A Parallel Machine Scheduling Problem with Release Dates, Equal Processing Times, and Eligibility Constraints
- Title
- A Parallel Machine Scheduling Problem with Release Dates, Equal Processing Times, and Eligibility Constraints
- Authors
- LEE, KANGBOK; Hong, Juntaek
- Date Issued
- 2018-11-05
- Publisher
- INFORMS
- Abstract
- We consider a problem of scheduling independent jobs on parallel machines to minimize the total completion time. Each job has a given release date and a set of eligible machines, and all jobs have equal processing times. For the problem with a fixed number of machines, we show its computational complexity of the problem by providing a polynomial time dynamic programming algorithm. For the problem with an arbitrary number of machines, we propose approximation algorithms and they are evaluated by worst-case analysis and numerical experiments.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/97392
- Article Type
- Conference
- Citation
- INFORMS annual meeting 2018, 2018-11-05
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.