Non-preemptive two-machine open shop scheduling with non-availability constraints

DOI10.1007/S001860200267zbMATH Open1023.90022OpenAlexW2066241012MaRDI QIDQ1395372FDOQ1395372

Authors: Joachim Breit, Günter Schmidt, V. A. Strusevich 

Publication date: 26 June 2003

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

Full work available at URL: https://doi.org/10.1007/s001860200267

Recommendations

• Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints
• Two-machine open shop scheduling with an availability constraint
• A PTAS for non-resumable open shop scheduling with an availability constraint
• Two-machine flow shop no-wait scheduling with a nonavailability interval
• A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint

zbMATH Keywords

worst-case analysisavailability constraintsopen shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (26)

• Title not available (Why is that?)
• A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
• Scheduling jobs with maintenance subject to load-dependent duration on a single machine
• Exponential inapproximability and FPTAS for scheduling with availability constraints
• Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
• Single machine scheduling with semi-resumable machine availability constraints
• A PTAS for non-resumable open shop scheduling with an availability constraint
• A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness
• Two-machine flow shop and open shop scheduling problems with a single maintenance window
• Two-machine open shop scheduling with an availability constraint
• MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS
• Scheduling jobs in open shops with limited machine availability
• Open shop scheduling problem with a non-resumable flexible maintenance period
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
• A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint
• Optimality of Jackson's permutations with respect to limited machine availability
• Operator non-availability periods
• Two-machine flow shop scheduling with an operator non-availability period to minimize makespan
• Approximation schemes for parallel machine scheduling with availability constraints
• Approximation results for flow shop scheduling problems with machine availability constraints
• Single machine scheduling with an operator non-availability period to minimize total completion time
• Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints
• Single-machine scheduling with machine unavailability periods and resource dependent processing times
• Order acceptance and scheduling with machine availability constraints

This page was built for publication: Non-preemptive two-machine open shop scheduling with non-availability constraints

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