A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times

This publication has 22 references indexed in Scilit:

• Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
  Computers & Operations Research, 2002
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
  European Journal of Operational Research, 2002
• Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
  Computers & Operations Research, 2000
• A review of scheduling research involving setup considerations
  Omega, 1999
• A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times
  Journal of the Operational Research Society, 1995
• Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns
  Journal of the Operational Research Society, 1995
• A branch-and-bound algorithm to minimize total tardiness with different release dates
  Naval Research Logistics (NRL), 1992
• Job lateness in a two-machine flowshop with setup times separated
  Computers & Operations Research, 1991
• Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
  European Journal of Operational Research, 1990
• Scheduling tasks with sequence-dependent processing times
  Naval Research Logistics (NRL), 1988