An improved heuristic for one-machine scheduling with delays constraints

DOI10.1007/BF02878690zbMATH Open0889.90083MaRDI QIDQ1373850FDOQ1373850

Authors: Bo Chen, Donglei Du, Jiye Han 

Publication date: 22 June 1998

Published in: Science in China. Series A (Search for Journal in Brave)

Recommendations

• An improved branch-and-bound algorithm for the one-machine scheduling problem with delayed precedence constraints
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
• A Heuristic for a Scheduling Problem with Communication Delays
• scientific article; zbMATH DE number 4055356

zbMATH Keywords

one-machine schedulingdelay constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Fast Approximation Algorithms for Knapsack Problems
• One-machine generalized precedence constrained scheduling problems
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling

Cited In (4)

• A new heuristic algorithm for the machine scheduling problem with job delivery coordination
• Title not available (Why is that?)
• An improved branch-and-bound algorithm for the one-machine scheduling problem with delayed precedence constraints
• A locally optimal insertion heuristic for a one-machine scheduling problem

This page was built for publication: An improved heuristic for one-machine scheduling with delays constraints

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