Review of sequencing research

DOI10.1002/nav.3800170103zbMath0202.18501OpenAlexW2162149932MaRDI QIDQ5599453

J. E. Day, M. P. Hottenstein

Publication date: 1970

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800170103

Related Items

Development and analysis of cost-based dispatching rules for job shop scheduling ⋮ A mixed integer program for loading and scheduling multiple flexible manufacturing cells ⋮ A survey of job shop scheduling problem: the types and models ⋮ A survey of priority rule-based scheduling ⋮ Characterizing the set of feasible sequences for n jobs to be carried out on a single machine ⋮ Search-based job shop scheduling and sequencing: Extensions to the search sequencing rule ⋮ Job oriented production scheduling ⋮ Heuristische Verfahren zur Maschinenbelegungsplanung bei Reihenfertigung ⋮ Integration of priority dispatching and due-date assignment in a job shop ⋮ Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs ⋮ A comparison of job shop dispatching rules using a total cost criterion ⋮ Evaluating variance control, order review/release and dispatching: a regression analysis ⋮ An expert neural network system for dynamic job shop scheduling ⋮ An integrated system for controlling shop loading and work flow ⋮ A study on the performance of scheduling rules in buffer-constrained dynamic flowshops ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ Scheduling research in multiple resource constrained job shops: a review and critique ⋮ A comparative study of dispatching rules in dynamic flowshops and jobshops

Cites Work

• Unnamed Item
• Unnamed Item
• On two queues in parallel
• Dynamic Programming Treatment of the Travelling Salesman Problem
• The sequencing of “related” jobs
• Some problems in queueing with dynamic priorities