Single-Server, Two-Machine Sequencing with Switching Time

DOI10.1287/OPRE.20.1.24zbMath0238.90033OpenAlexW2043778878MaRDI QIDQ5650500

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

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

Related Items (10)

One-machine batching and sequencing of multiple-type items ⋮ Batch scheduling to minimize total completion time ⋮ Unrelated parallel machine scheduling with new criteria: complexity and models ⋮ Scheduling with multiple servers ⋮ Minimizing total weighted completion time approximately for the parallel machine problem with a single server ⋮ Scheduling two job classes on a single machine ⋮ Parallel machine scheduling problems with a single server ⋮ 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 two parallel semiautomatic machines to minimize machine interference

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