Minimizing makespan on a single machine with release dates and inventory constraints

DOI10.1016/J.EJOR.2020.03.029MaRDI QIDQ2184096zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 27 May 2020

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://lirias.kuleuven.be/handle/123456789/613250

zbMATH Keywords

branch-and-boundcomplexitydynamic programminginventory constraintLagrangian relaxationsingle-machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Exact algorithms for inventory constrained scheduling on a single machine
• Bicriteria Scheduling on Single-Machine with Inventory Operations
• BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS
• Complexity of single machine scheduling subject to nonnegative inventory constraints
• Approximation algorithms for inventory constrained scheduling on a single machine

Cites work

• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
• A PTAS for a resource scheduling problem with arbitrary number of parallel machines
• Approximability of scheduling problems with resource consuming jobs
• Approximability of total weighted completion time with resource consuming jobs
• Approximation schemes for single machine scheduling with non-renewable resource constraints
• Batch scheduling in process industries: An application of resource-constrained project scheduling
• Complexity of single machine scheduling subject to nonnegative inventory constraints
• Exact algorithms for inventory constrained scheduling on a single machine
• Exact algorithms for single-machine scheduling with time windows and precedence constraints
• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
• Project scheduling with inventory constraints
• Scheduling of continuous and discontinuous material flows with intermediate storage restrictions
• Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times
• Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity
• Scheduling subject to nonrenewable-resource constraints
• Scheduling under a Non-renewable Resource Constraint
• Single machine scheduling problems with financial resource constraints: some complexity results and properties

Cited in

(8)

• Target-based distributionally robust optimization for single machine scheduling
• On the integration of diverging material flows into resource-constrained project scheduling
• Exact algorithms for inventory constrained scheduling on a single machine
• Interweaving real-time jobs with energy harvesting to maximize throughput
• Single machine scheduling with release dates: a distributionally robust approach
• A multivariate complexity analysis of the material consumption scheduling problem
• Interweaving real-time jobs with energy harvesting to maximize throughput
• State-dependent machine availability in scheduling

This page was built for publication: Minimizing makespan on a single machine with release dates and inventory constraints

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