A fast finite loading algorithm for job oriented scheduling

DOI10.1016/S0305-0548(96)00035-4MaRDI QIDQ1373899zbMATH OpenFDO

Authors Chung-Hsing Yeh

Publication date 25 November 1997

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0305-0548(96)00035-4

zbMATH Keywords

capacity constrained parallel machinesjob oriented scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Job oriented production scheduling
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Practical job shop scheduling
• Scheduling the General Job-Shop
• Optimal job-shop scheduling with two jobs in systems with unrestricted paths

Cites work

• A backward approach in list scheduling algorithms for multi-machine tardiness problems
• A Survey of Scheduling Rules
• Effective job shop scheduling through active chain manipulation
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• Job oriented production scheduling

Cited in

(2)

• Scheduling partially ordered jobs faster than \(2^n\)
• Dynamic scheduling for complex engineer-to-order products

This page was built for publication: A fast finite loading algorithm for job oriented scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373899)