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

DOI10.1007/s10951-013-0334-0zbMath1297.90030OpenAlexW2055832862MaRDI QIDQ398878

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

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

Related Items (5)

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

Cites Work

• Unnamed Item
• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
• Soft car sequencing with colors: lower bounds and optimality proofs
• Combining two pheromone structures for solving the car sequencing problem with ant colony optimization
• Sequencing mixed-model assembly lines: survey, classification and model critique
• Paintshop, odd cycles and necklace splitting
• 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
• A sequential ordering problem in automotive paint shops
• Searching optimal resequencing and feature assignment on an automated assembly line
• Special cases of traveling salesman and repairman problems with time windows
• On the Complexity of Scheduling with Batch Setup Times
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Scheduling

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