A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
Authors:
- Tamás KisTKTamás Kis
- Erwin PeschEPErwin Pesch
- 1 August 2005
- journal article
- review article
- Published by Elsevier in European Journal of Operational Research
- Vol. 164 (3) , 592-608
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- A flexible flowshop problem with total flow time minimizationEuropean Journal of Operational Research, 2001
- An Exact Method for Solving the Multi-Processor Flow-ShopRAIRO - Operations Research, 2000
- Jackson's Pseudo Preemptive Schedule for the Pm/r i , q i /C max scheduling problemAnnals of Operations Research, 1998
- The job shop scheduling problem: Conventional and new solution techniquesEuropean Journal of Operational Research, 1996
- Branch and bound algorithm for the flow shop with multiple processorsEuropean Journal of Operational Research, 1991
- Two-Stage, Hybrid Flowshop Scheduling ProblemJournal of the Operational Research Society, 1988
- Scheduling jobs with release dates and tails on identical machines to minimize the makespanEuropean Journal of Operational Research, 1987
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- Two-Processor Scheduling with Start-Times and DeadlinesSIAM Journal on Computing, 1977
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976