A polynomial algorithm for lot-size scheduling of two type tasks.

DOI10.1016/S0020-0190(01)00331-3zbMath1051.68142OpenAlexW1980522496MaRDI QIDQ1853075

Mikhail Y. Kovalyov, Günter Schmidt, Marcus Pattloch

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00331-3

zbMATH Keywords

AlgorithmsParallel machinesLot-size scheduling

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing the number of tardy job units under release time constraints
• A polynomial algorithm for a one machine batching problem
• Deterministic lotsizing models for production planning
• Batch scheduling with deadlines on parallel machines
• A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem
• A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
• Uniform machine scheduling of unit-time jobs subject to resource constraints
• Lot-size scheduling of two types of jobs on identical machines
• Scheduling with batching: A review
• Note on “Parallel Machine Scheduling with Batch Setup Times”
• A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
• Some Optimum Algorithms for Scheduling Problems with Changeover Costs
• Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
• High Multiplicity in Earliness-Tardiness Scheduling
• Minimum Change-Over Scheduling of Several Products on One Machine
• Optimum Production Scheduling of Multicommodity in Flow Line
• Parallel machine scheduling with high multiplicity

This page was built for publication: A polynomial algorithm for lot-size scheduling of two type tasks.