Exact algorithms for inventory constrained scheduling on a single machine

DOI10.1007/s10951-011-0261-xzbMath1297.90065OpenAlexW2119934501MaRDI QIDQ398845

Erwin Pesch, Florian Jaehn, Dirk Briskorn

Publication date: 18 August 2014

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

Full work available at URL: https://doi.org/10.1007/s10951-011-0261-x

zbMATH Keywords

machine schedulingdynamic programmingbranch and boundinventory constraints

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Inventory, storage, reservoirs (90B05) Stochastic scheduling theory in operations research (90B36) Dynamic programming (90C39)

Related Items (15)

Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints ⋮ On the integration of diverging material flows into resource-constrained project scheduling ⋮ Minimizing makespan on a single machine with release dates and inventory constraints ⋮ Approximation schemes for single machine scheduling with non-renewable resource constraints ⋮ Approximation schemes for parallel machine scheduling with non-renewable resources ⋮ Approximation algorithms for inventory constrained scheduling on a single machine ⋮ Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times ⋮ Reductions between scheduling problems with non-renewable resources and knapsack problems ⋮ Approximability of total weighted completion time with resource consuming jobs ⋮ Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints ⋮ A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource ⋮ Optimizing consolidation processes in hubs: the hub-arrival-departure problem ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ An FPTAS of minimizing total weighted completion time on single machine with position constraint ⋮ Approximability of scheduling problems with resource consuming jobs

Cites Work

• Unnamed Item
• Truck scheduling at zero-inventory cross docking terminals
• Truck dock assignment problem with operational time constraint within crossdocks
• Scheduling tests in automotive R\&D projects
• Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan
• Complexity of single machine scheduling subject to nonnegative inventory constraints
• Minimizing makespan in two-stage hybrid cross docking scheduling problem
• Scheduling a maintenance activity and due-window assignment on a single machine
• Scheduling of continuous and discontinuous material flows with intermediate storage restrictions
• Project scheduling with inventory constraints
• Batch scheduling in process industries: An application of resource-constrained project scheduling
• Truck scheduling in cross-docking terminals with fixed outbound departures
• Scheduling inbound and outbound trucks at cross docking terminals
• Scheduling of inbound and outbound trucks in cross docking systems with temporary storage
• Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
• Minimizing the makespan in a two-machine cross-docking flow shop problem
• A Dynamic Programming Approach to Sequencing Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling

This page was built for publication: Exact algorithms for inventory constrained scheduling on a single machine