A general search sequencing rule for job shop sequencing

DOI10.1080/00207548508904759zbMath0569.90046OpenAlexW1985035176MaRDI QIDQ3686420

No author found.

Publication date: 1985

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207548508904759

zbMATH Keywords

heuristicsperformance functionjob shop sequencingsearch sequencing rule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Evolution based learning in a job shop scheduling environment ⋮ A backward approach in list scheduling algorithms for multi-machine tardiness problems ⋮ A survey of priority rule-based scheduling ⋮ Search-based job shop scheduling and sequencing: Extensions to the search sequencing rule ⋮ A due date-based approach to part type selection in flexible manufacturing systems ⋮ The job shop scheduling problem: Conventional and new solution techniques

Cites Work

• `` Direct Search Solution of Numerical and Statistical Problems
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Search and Simulation Selection of a Job-Shop Sequencing Rule

This page was built for publication: A general search sequencing rule for job shop sequencing