Problem and Heuristic Space Search Strategies for Job Shop Scheduling
From MaRDI portal
Publication:4869760
DOI10.1287/ijoc.7.4.453zbMath0843.90059OpenAlexW2134080374MaRDI QIDQ4869760
S. David Wu, Renzo Vaccari, Robert H. Storer
Publication date: 19 August 1996
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.7.4.453
Related Items (9)
A machine-order search space for job-shop scheduling problems ⋮ Metaheuristics: A bibliography ⋮ Unnamed Item ⋮ Algorithms for single machine total tardiness scheduling with sequence dependent setups ⋮ One-machine rescheduling heuristics with efficiency and stability as criteria ⋮ A new dominance rule to minimize total weighted tardiness with unequal release dates. ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ Job-shop scheduling with blocking and no-wait constraints
This page was built for publication: Problem and Heuristic Space Search Strategies for Job Shop Scheduling
