Universal sequencing on a single machine

DOI10.1007/978-3-642-13036-6_18MaRDI QIDQ3569821zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Leah Epstein, Asaf Levin, Nicole Megow, Julián Mestre, Alberto Marchetti-Spaccamela, L. Stougie, Martin Skutella

Publication date 22 June 2010

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://research.vu.nl/en/publications/6c248980-7e48-4264-ad53-7a7b6e34f116

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Universal sequencing on an unreliable machine
• Minimizing total weighted completion time with an unexpected machine unavailable interval
• scientific article; zbMATH DE number 5732726
• A note on minimizing total weighted completion time with an unexpected machine unavailable interval
• Minimizing total weighted completion time with unexpected machine unavailability

Cited in

(8)

• The symmetric quadratic knapsack problem: approximation and scheduling applications
• For the airplane refueling problem local precedence implies global precedence
• The local-global conjecture for scheduling with non-linear cost
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
• Universal sequencing on an unreliable machine
• Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints (extended abstract)
• A primal-dual approximation algorithm for min-sum single-machine scheduling problems
• Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times

This page was built for publication: Universal sequencing on a single machine

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