Search-based job shop scheduling and sequencing: Extensions to the search sequencing rule

DOI10.1016/0895-7177(90)90367-VzbMath0693.90045OpenAlexW2122932719MaRDI QIDQ908838

N. E. Zubov

Publication date: 1990

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(90)90367-v

zbMATH Keywords

simulationmanufacturing systemsequencingqueue lengthjob prioritysearch-based job shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Production models (90B30)

Cites Work

• Unnamed Item
• Scheduling with Deadlines and Loss Functions
• A general search sequencing rule for job shop sequencing
• A Review of Production Scheduling
• Search and Simulation Selection of a Job-Shop Sequencing Rule
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The Sequencing Problem
• Review of sequencing research

This page was built for publication: Search-based job shop scheduling and sequencing: Extensions to the search sequencing rule