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

DOI10.1007/S10479-013-1446-9MaRDI QIDQ2449360zbMATH OpenOpenAlexFDO

Authors Djamal Rebaine, Mehdi Serairi, A. 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

complexityheuristicslower boundsmakespanopen shopresource requirementscheduling

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5260089
• Two-machine open shop scheduling with an availability constraint
• scientific article; zbMATH DE number 930117
• A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint
• Two machine open shop scheduling problems with bi-criteria
• Two-machine open shop scheduling with machine-dependent processing times
• Two machine openshop scheduling with machine-dependent processing times
• Scheduling two-machine preemptive open shops to minimize total completion time
• Scheduling two-machine no-wait open shops to minimize makespan
• Two-machine open-shop scheduling with outsourcing

Cites work

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

Cited in

(12)

• On the complexity of two machine job-shop scheduling with regular objective functions
• FPTAS for the two identical parallel machine problem with a single operator under the free changing mode
• The two-machine open shop problem: To fit or not to fit, that is the question
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Two-machine open shop problem with agreement graph
• Open shop scheduling problems with conflict graphs
• Two-machine open shop problem with a single server and set-up time considerations
• scientific article; zbMATH DE number 4131935 (Why is no real title available?)
• Stochastic scheduling for a two-machine open shop
• scientific article; zbMATH DE number 5260089 (Why is no real title available?)
• Solving the two-machine open shop problem with a single server with respect to the makespan
• Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2449360)