Exact algorithms for inventory constrained scheduling on a single machine
From MaRDI portal
Publication:398845
DOI10.1007/S10951-011-0261-XzbMATH Open1297.90065OpenAlexW2119934501MaRDI QIDQ398845FDOQ398845
Authors: Dirk Briskorn, Florian Jaehn, Erwin Pesch 
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
Recommendations
- Approximation algorithms for inventory constrained scheduling on a single machine
- Complexity of single machine scheduling subject to nonnegative inventory constraints
- Bicriteria Scheduling on Single-Machine with Inventory Operations
- BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS
- Minimizing makespan on a single machine with release dates and inventory constraints
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Dynamic programming (90C39) Inventory, storage, reservoirs (90B05) Stochastic scheduling theory in operations research (90B36)
Cites Work
- Project scheduling with inventory constraints
- A Dynamic Programming Approach to Sequencing Problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Complexity of single machine scheduling subject to nonnegative inventory constraints
- Title not available (Why is that?)
- Scheduling
- Batch scheduling in process industries: An application of resource-constrained project scheduling
- Minimizing makespan in two-stage hybrid cross docking scheduling problem
- 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
- Truck scheduling at zero-inventory cross docking terminals
- Truck dock assignment problem with operational time constraint within crossdocks
- Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan
- Scheduling a maintenance activity and due-window assignment on a single machine
- Scheduling of continuous and discontinuous material flows with intermediate storage restrictions
- Scheduling tests in automotive R\&D projects
Cited In (18)
- Approximability of scheduling problems with resource consuming jobs
- Approximation schemes for single machine scheduling with non-renewable resource constraints
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Reductions between scheduling problems with non-renewable resources and knapsack problems
- Approximation algorithms for inventory constrained scheduling on a single machine
- Complexity of single machine scheduling subject to nonnegative inventory constraints
- Terminal inventory level constraints for online production scheduling
- Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints
- An FPTAS of minimizing total weighted completion time on single machine with position constraint
- 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
- A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource
- Approximation schemes for parallel machine scheduling with non-renewable resources
- Approximability of total weighted completion time with resource consuming jobs
- Optimizing consolidation processes in hubs: the hub-arrival-departure problem
- Bicriteria Scheduling on Single-Machine with Inventory Operations
- Minimizing makespan on a single machine with release dates and inventory constraints
- Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times
This page was built for publication: Exact algorithms for inventory constrained scheduling on a single machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398845)
