Product grouping for batch processes

DOI10.1080/00207549608905079zbMath0928.90022OpenAlexW2035661140MaRDI QIDQ4230294

Philip C. Jones, Robert R. Inman

Publication date: 1 March 1999

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207549608905079

zbMATH Keywords

heuristicmultiple productsbatch processesproduct groupinginventory carrying costspolynomial-time procedure

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (1)

Economic lot scheduling with resources in parallel

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling stochastic jobs with due dates on parallel machines
• A state-of-the-art review of parallel-machine scheduling research
• Economic Lot Scheduling for Multiple Products on Parallel Identical Processors
• Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
• Batching to Minimize Flow Times on Parallel Heterogeneous Machines
• Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
• A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
• Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
• Scheduling Cyclic Production on Several Identical Machines
• On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine
• Some Heuristics for Scheduling Jobs on Parallel Machines with Setups

This page was built for publication: Product grouping for batch processes