Makespan minimization for two parallel machines with an availability constraint
- 16 January 2005
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 160 (2), 445-456
- https://doi.org/10.1016/j.ejor.2003.08.034
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A note on “parallel machine scheduling with non-simultaneous machine available time”Discrete Applied Mathematics, 2000
- Scheduling jobs and maintenance activities on parallel machinesNaval Research Logistics (NRL), 2000
- Two-machine flowshop scheduling with availability constraintsEuropean Journal of Operational Research, 1999
- Algorithms for multiprocessor scheduling with machine release timesIIE Transactions, 1998
- Current trends in deterministic schedulingAnnals of Operations Research, 1997
- Machine scheduling with an availability constraintJournal of Global Optimization, 1996
- Makespan minimization form parallel identical processorsNaval Research Logistics (NRL), 1995
- Minimizing the sum of job completion times on capacitated parallel machinesMathematical and Computer Modelling, 1994
- Capacitated two-parallel machines scheduling to minimize sum of job completion timesDiscrete Applied Mathematics, 1993
- Parallel machines scheduling with nonsimultaneous machine available timeDiscrete Applied Mathematics, 1991