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

Authors:
Xiuli Wang;T. C. E. Cheng
Affiliations:
College of Electrical Engineering, Zhejiang University, PR China;Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Venue:
Computers and Operations Research
Year:
2005

Citing 6
Cited 3

Single facility multi-class job scheduling

Computers and Operations Research
Scheduling two job classes on a single machine

Computers and Operations Research
Flowshop scheduling with dominant machines

Computers and Operations Research
A heuristic algorithm for mean flowtime objective in flowshop scheduling

Computers and Operations Research
Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times

Computers and Operations Research
Scheduling Algorithms

Scheduling Algorithms

Fuzzy scheduling of job orders in a two-stage flowshop with batch-processing machines

International Journal of Approximate Reasoning
Machine scheduling with job class setup and delivery considerations

Computers and Operations Research
A parallel distributed algorithm for the permutation flow shop scheduling problem

ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II

Quantified Score

Hi-index	0.01

Visualization

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.