Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions

DOI10.1007/S10951-013-0334-0MaRDI QIDQ398878zbMATH OpenOpenAlexFDO

Authors Stefan Bock, Kathrin Klamroth

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-013-0334-0

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Flow shop batching and scheduling with sequence-dependent setup times
• Optimal due-date determination and sequencing with random processing times
• The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
• Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines
• Minimizing the sum of the total completion time and batching costs on a batch processing machine
• Capacitated lot-sizing with sequence dependent setup costs
• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• Optimal due-date assignment and sequencing in a single machine shop
• A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups
• Optimal Cycle Times in Multistage Serial Systems with Set-Up and Inventory Costs

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A sequential ordering problem in automotive paint shops
• Combining two pheromone structures for solving the car sequencing problem with ant colony optimization
• Complexity results on a paint shop problem.
• Complexity results on restricted instances of a paint shop problem for words
• Controlling mixed-model assembly lines in real-time by using distributed systems
• Dynamic programming to minimize the maximum number of open stacks
• On the Complexity of Scheduling with Batch Setup Times
• Paintshop, odd cycles and necklace splitting
• Scheduling
• Searching optimal resequencing and feature assignment on an automated assembly line
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Sequencing mixed-model assembly lines: survey, classification and model critique
• Soft car sequencing with colors: lower bounds and optimality proofs
• Special cases of traveling salesman and repairman problems with time windows
• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem

Cited in

(5)

• Integrated real-time control of mixed-model assembly lines and their part feeding processes
• Solving the traveling repairman problem on a line with general processing times and deadlines
• Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios
• Finding optimal tour schedules on transportation paths under extended time window constraints
• Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios

This page was built for publication: Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions

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