Lot-size scheduling of two types of jobs on identical machines

DOI10.1016/0166-218X(95)00044-RzbMath0846.90052OpenAlexW1993633301MaRDI QIDQ1917283

Marcus Pattloch, Günter Schmidt

Publication date: 30 September 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(95)00044-r

zbMATH Keywords

NP-hardidentical parallel machineschangeover costlot-size scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
• Some Optimum Algorithms for Scheduling Problems with Changeover Costs
• A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem
• Deterministic Production Planning: Algorithms and Complexity
• Computational Complexity of the Capacitated Lot Size Problem
• Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
• Minimum Change-Over Scheduling of Several Products on One Machine
• Optimum Production Scheduling of Multicommodity in Flow Line

This page was built for publication: Lot-size scheduling of two types of jobs on identical machines