Scheduling the two-machine open shop problem under resource constraints for setting the jobs

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,...

Full description

Saved in:
Bibliographic Details
Published in:Annals of operations research 2013-12, Vol.211 (1), p.333-356
Main Authors: Oulamara, Ammar, Rebaine, Djamal, Serairi, Mehdi
Format: Article
Language:English
Subjects:
Algorithms
Business and Management
Combinatorics
Computer Science
Heuristic
Heuristic methods
Job shops
Operations Research
Operations Research/Decision Theory
Production scheduling
Renewable resources
Scheduling
Studies
Theory of Computation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 -hardness of several versions of this problem. Then, we present a well solvable case, lower bounds, and heuristic algorithms along with an experimental study.
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-013-1446-9