A bi-criteria two-machine flowshop scheduling problem with a learning effect
Authors:
- 1 September 2006
- journal article
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 57 (9) , 1113-1125
Abstract
This paper addresses a bi-criteria two-machine flowshop scheduling problem when the learning effect is present. The objective is to find a sequence that minimizes a weighted sum of the total completion time and the maximum tardiness. In this article, a branch-and-bound method, incorporating several dominance properties and a lower bound, is presented to search for the exact solution for small job-size problems. In addition, two heuristic algorithms are proposed to overcome the inefficiency of the branch-and-bound algorithm for large job-size problems. Finally, computational results for this problem are provided to evaluate the performance of the proposed algorithms.Keywords
This publication has 19 references indexed in Scilit:
- Minimizing total completion time in a two-machine flowshop with a learning effectInternational Journal of Production Economics, 2004
- A bi-criterion single-machine scheduling problem with learning considerationsActa Informatica, 2004
- A Simulated Annealing Approach to Bicriteria Scheduling Problems on a Single MachineJournal of Heuristics, 2000
- Single-machine scheduling with learning considerationsEuropean Journal of Operational Research, 1999
- A survey of simulated annealing applications to operations research problemsOmega, 1994
- A note on the effect of neighborhood structure in simulated annealingComputers & Operations Research, 1991
- Bicriterion static scheduling research for a single machineOmega, 1988
- Optimization by Simulated AnnealingScience, 1983
- A dual algorithm for the one-machine scheduling problemMathematical Programming, 1976
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976