Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan
Authors:
- Fawaz S. Al-AnziFAFawaz S. Al-Anzi
- Ali AllahverdiAAAli Allahverdi
- 1 September 2009
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 36 (9) , 2682-2689
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup timesEuropean Journal of Operational Research, 2007
- The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion timeThe International Journal of Advanced Manufacturing Technology, 2007
- Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup timesInternational Journal of Production Research, 2006
- A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database applicationComputers & Operations Research, 2006
- Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop schedulingEuropean Journal of Operational Research, 2003
- Particle swarm optimization for task assignment problemMicroprocessors and Microsystems, 2002
- A branch and bound algorithm for the two-stage assembly scheduling problemEuropean Journal of Operational Research, 1997
- The Two-Stage Assembly Scheduling Problem: Complexity and ApproximationOperations Research, 1995
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling ProblemManagement Science, 1993
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954