A machine-order search space for job-shop scheduling problems
From MaRDI portal
Publication:4814098
DOI10.1111/1475-3995.00430zbMath1108.90313OpenAlexW2083587458MaRDI QIDQ4814098
No author found.
Publication date: 7 September 2004
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/1475-3995.00430
Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Mathematical programming formulations for machine scheduling: A survey
- The job shop scheduling problem: Conventional and new solution techniques
- Deterministic job-shop scheduling: Past, present and future
- A computational study of shifting bottleneck procedures for shop scheduling problems
- A Computational Study of the Job-Shop Scheduling Problem
- Problem and Heuristic Space Search Strategies for Job Shop Scheduling
This page was built for publication: A machine-order search space for job-shop scheduling problems
