Back to Search
Start Over
Scheduling the two-machine open shop problem under resource constraints for setting the jobs.
- Source :
-
Annals of Operations Research . Dec2013, Vol. 211 Issue 1, p333-356. 24p. - Publication Year :
- 2013
-
Abstract
- This paper addresses the problem of open shop scheduling on two machines with resources constraints. In the context of our study, in order to be executed, a job requires first, for its preparation for a given period of time, a number of resources which cannot exceed a given resource capacity. Then, it goes onto its execution while the resources allocated to it become available again. We seek a schedule that minimizes the makespan. We first prove the $\mathcal{N}\mathcal{P}$ -hardness of several versions of this problem. Then, we present a well solvable case, lower bounds, and heuristic algorithms along with an experimental study. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 02545330
- Volume :
- 211
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Annals of Operations Research
- Publication Type :
- Academic Journal
- Accession number :
- 92774874
- Full Text :
- https://doi.org/10.1007/s10479-013-1446-9