Problem and Heuristic Space Search Strategies for Job Shop Scheduling
From MaRDI portal
Publication:4869760
DOI10.1287/ijoc.7.4.453zbMath0843.90059MaRDI QIDQ4869760
S. David Wu, Robert H. Storer, Renzo Vaccari
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
90B35: Deterministic scheduling theory in operations research
Related Items
A machine-order search space for job-shop scheduling problems, A new dominance rule to minimize total weighted tardiness with unequal release dates., One-machine rescheduling heuristics with efficiency and stability as criteria, The job shop scheduling problem: Conventional and new solution techniques, Deterministic job-shop scheduling: Past, present and future, Job-shop scheduling with blocking and no-wait constraints, Metaheuristics: A bibliography, Algorithms for single machine total tardiness scheduling with sequence dependent setups, Unnamed Item