Heuristics for scheduling with inventory: Dynamic focus via constraint criticality

DOI10.1002/JOS.91zbMath0995.90027OpenAlexW2073901754MaRDI QIDQ1347601

J. Christopher Beck

Publication date: 29 April 2002

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jos.91

zbMATH Keywords

schedulinginventoryconstraintsheuristic searchproblem structure

Mathematics Subject Classification ID

Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Inventory, storage, reservoirs (90B05)

Related Items (4)

The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm ⋮ Time-constrained project scheduling with adjacent resources ⋮ A cyclic approach to large-scale short-term planning in chemical batch production ⋮ Complexity of single machine scheduling subject to nonnegative inventory constraints

Cites Work

• Unnamed Item
• Unnamed Item
• The job shop scheduling problem: Conventional and new solution techniques
• The ODO project: Toward a unified basis for constraint-directed scheduling
• Adjustment of heads and tails for the job-shop problem
• Constraint-directed techniques for scheduling alternative activities
• Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
• Benchmarks for basic scheduling problems

This page was built for publication: Heuristics for scheduling with inventory: Dynamic focus via constraint criticality