Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times

Authors:
Ali Allahverdi
Affiliations:
-
Venue:
Computers and Operations Research
Year:
2000

Citing 0
Cited 5

Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW Applications

Computers and Operations Research
A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem

Computers and Operations Research
Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines

Computers and Operations Research
Two-machine flowshop scheduling with job class setups to minimize total flowtime

Computers and Operations Research
An exact method for Pm/sds,ri/Σi=1nCi problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract