Non-preemptive two-machine open shop scheduling with non-availability constraints
From MaRDI portal
Publication:1395372
DOI10.1007/s001860200267zbMath1023.90022MaRDI 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
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time, Approximation schemes for parallel machine scheduling with availability constraints, Single machine scheduling with semi-resumable machine availability constraints, 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, Exponential inapproximability and FPTAS for scheduling with availability constraints, Operator non-availability periods, Scheduling jobs with maintenance subject to load-dependent duration on a single machine, Order acceptance and scheduling with machine availability constraints, Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time, MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS
