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

DOI10.1007/S001860200267MaRDI QIDQ1395372zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

availability constraintsopen shop schedulingworst-case analysis

Mathematics Subject Classification ID

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

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

Cited in

(27)

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

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)