Skip to main content
Article thumbnail
Location of Repository

An Evaluation of Sequencing Heuristics for Flexible Flowshop Scheduling Problems with Unrelated Parallel Machines and Dual Criteria

By Jitti Jungwattanakit A, Manop Reodecha A, Paveena Chaovalitwongse A and Frank Werner B

Abstract

This paper deals with the heuristic solution of flexible flowshop scheduling problems with unrelated parallel machines. A setup time is necessary before starting the processing of a job, where the setup time depends on the previous job. No preemption of jobs is allowed. As objective function, this paper considers the minimization of the positively weighted convex sum of makespan and the number of tardy jobs. This paper develops some well-known constructive heuristics for the pure flowshop scheduling problems such as the algorithms given by Palmer (1965), Campbell, Dudek, and Smit

Topics: flexible flowshop, heuristics, NEH, genetic algorithm, simulated annealing
Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.2470
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.math.uni-magdeburg.... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.