Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- 1 April 2008
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 35 (4) , 1250-1264
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup timesEuropean Journal of Operational Research, 2007
- A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup timeComputers & Operations Research, 2004
- Makespan minimization on uniform parallel machines with release timesEuropean Journal of Operational Research, 2004
- Simultaneous lotsizing and scheduling by combining local search with dual reoptimizationEuropean Journal of Operational Research, 2000
- Scheduling flexible flow shops with sequence-dependent setup effectsIEEE Transactions on Robotics and Automation, 2000
- A grasp for single machine scheduling with sequence dependent setup costs and linear delay penaltiesComputers & Operations Research, 1996
- Minimizing the number of tardy jobs for m parallel machinesEuropean Journal of Operational Research, 1995
- Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 1995
- Impact of sequence-dependent setup time on job shop scheduling performanceInternational Journal of Production Research, 1994
- An integer linear‐programming model for machine schedulingNaval Research Logistics Quarterly, 1959