Single-Server, Two-Machine Sequencing with Switching Time

DOI10.1287/OPRE.20.1.24MaRDI QIDQ5650500zbMATH OpenOpenAlexFDO

Authors Vinod K. Sahney

Publication date 1972

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.20.1.24

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cited in

(11)

• Scheduling two job classes on a single machine
• One-machine batching and sequencing of multiple-type items
• Batch scheduling to minimize total completion time
• Minimizing total weighted completion time approximately for the parallel machine problem with a single server
• Scheduling two parallel semiautomatic machines to minimize machine interference
• Unrelated parallel machine scheduling with new criteria: complexity and models
• A heuristic approach for single-machine scheduling with due dates and class setups.
• Scheduling parallel machines with a single server: Some solvable cases and heuristics
• Scheduling with multiple servers
• Scheduling on identical machines with setup time and unknown execution time
• Parallel machine scheduling problems with a single server

This page was built for publication: Single-Server, Two-Machine Sequencing with Switching Time

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