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

DOI10.1007/s10479-013-1446-9zbMath1286.90064OpenAlexW2074707342MaRDI QIDQ2449360

Djamal Rebaine, Mehdi Serairi, Ammar Oulamara

Publication date: 8 May 2014

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-013-1446-9

zbMATH Keywords

complexityheuristicsschedulingmakespanopen shoplower boundsresource requirement

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Two-machine open shop problem with a single server and set-up time considerations ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ FPTAS for the two identical parallel machine problem with a single operator under the free changing mode ⋮ Open shop scheduling problems with conflict graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of interval scheduling with a resource constraint
• Unit-time scheduling problems with time dependent resources
• New directions in scheduling theory
• Scheduling subject to resource constraints: Classification and complexity
• Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
• One-operator-two-machine flowshop scheduling with setup and dismounting times
• Scheduling problems for parallel dedicated machines under multiple resource constraints.
• Addendum: Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Scheduling parallel dedicated machines under a single non-shared resource
• A preemptive open shop scheduling problem with one resource
• Open Shop Scheduling to Minimize Finish Time
• Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Two-Machine Open Shops with Renewable Resources
• Scheduling for parallel dedicated machines with a single server

This page was built for publication: Scheduling the two-machine open shop problem under resource constraints for setting the jobs