A fast finite loading algorithm for job oriented scheduling

DOI10.1016/S0305-0548(96)00035-4zbMATH Open0890.90113MaRDI QIDQ1373899FDOQ1373899

Authors: Chung-Hsing Yeh 

Publication date: 25 November 1997

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

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

zbMATH Keywords

capacity constrained parallel machinesjob oriented scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• A Survey of Scheduling Rules
• A backward approach in list scheduling algorithms for multi-machine tardiness problems
• Job oriented production scheduling
• Effective job shop scheduling through active chain manipulation

Cited In (2)

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

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)