A new constructive heuristic for the flowshop scheduling problem

DOI10.1016/S0377-2217(97)00027-1zbMath0957.90053MaRDI QIDQ1291704

Christos P. Koulamas

Publication date: 22 March 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

scheduling theory; makespan; heuristic; flowshop

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Scheduling production tasks in a two-stage FMS, Flowshop-scheduling problems with makespan criterion: a review, A note on scheduling flowshops with flexible stage ordering, Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops, General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach, Non-permutation flow shop scheduling with order acceptance and weighted tardiness, Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness, An improved NEH-based heuristic for the permutation flowshop problem, An improved particle swarm optimization algorithm for flowshop scheduling problem, Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop., A comprehensive review and evaluation of permutation flowshop heuristics, Fast heuristics for minimizing the makespan in non-permutation flow shops, Solving permutation flow shop scheduling problem with sequence-independent setup time, Flow shop scheduling with heterogeneous workers, A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling, An improved genetic algorithm for the flowshop scheduling problem

Cites Work

• New results in the worst-case analysis for flow-shop scheduling
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Some efficient heuristic methods for the flow shop sequencing problem
• A new heuristic method for the flow shop sequencing problem
• Worst-case analysis of an approximation algorithm for flow-shop scheduling
• Permutation vs. non-permutation flow shop schedules
• Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
• A fast tabu search algorithm for the permutation flow-shop problem
• Sevast'yanov's algorithm for the flow-shop scheduling problem
• A note on worst-case analysis of approximation algorithms for a scheduling problem
• A new heuristic for the n-job, M-machine flow-shop problem
• Optimal two- and three-stage production schedules with setup times included
• A survey and evaluation of static flowshop scheduling heuristics
• Technical Note—Johnson's Three-Machine Flow-Shop Conjecture
• Flowshop and Jobshop Schedules: Complexity and Approximation
• An Evaluation of Flow Shop Sequencing Heuristics
• The Complexity of Flowshop and Jobshop Scheduling
• Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
• A Note on Heuristics of Flow-Shop Scheduling