Two-machine flowshop scheduling with job class setups to minimize total flowtime

Two-machine flowshop scheduling with job class setups to minimize total flowtime

0.00 Avg rating0 Votes
Article ID: iaor20062605
Country: United Kingdom
Volume: 32
Issue: 11
Start Page Number: 2751
End Page Number: 2770
Publication Date: Nov 2005
Journal: Computers and Operations Research
Authors: ,
Keywords: heuristics
Abstract:

This paper studies the two-machine flowshop scheduling problem with job class setups to minimize the total flowtime. The jobs are classified into classes, and a setup is required on a machine if it switches processing of jobs from one class to another class, but no setup is required if the jobs are from the same class. For some special cases, we derive a number of properties of the optimal solution, based on which we design heuristics and branch-and-bound algorithms to solve these problems. Computational results show that these algorithms are effective in yielding near-optimal or optimal solutions to the tested problems.

Reviews

Required fields are marked *. Your email address will not be published.