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

DOI10.1007/s001860200267zbMath1023.90022OpenAlexW2066241012MaRDI QIDQ1395372

Joachim Breit, Vitaly A. Strusevich, Günter Schmidt

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

worst-case analysisopen shop schedulingavailability constraints

Mathematics Subject Classification ID

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

Related Items

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 ⋮ Scheduling jobs with maintenance subject to load-dependent duration on a single machine ⋮ Approximation schemes for parallel machine scheduling with availability constraints ⋮ Single machine scheduling with semi-resumable machine availability constraints ⋮ Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time ⋮ Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time ⋮ 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 ⋮ Approximation results for flow shop scheduling problems with machine availability constraints ⋮ Order acceptance and scheduling with machine availability constraints ⋮ Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications ⋮ 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 ⋮ MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS ⋮ Exponential inapproximability and FPTAS for scheduling with availability constraints ⋮ Operator non-availability periods

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