A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs
From MaRDI portal
Publication:2467257
DOI10.1016/j.ejor.2006.06.063zbMath1137.90509MaRDI QIDQ2467257
Jonathan F. Bard, Susan K. Monkman, Douglas J. Morrice
Publication date: 21 January 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.06.063
production scheduling; GRASP; product families; traveling salesman subtour problem; sequence-dependant setup costs
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
The third comprehensive survey on scheduling problems with setup times/costs, Assemble-to-order systems: a review, Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach, A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines, A survey of scheduling problems with setup times or costs, An integrated approach for lean production using simulation and data envelopment analysis
Cites Work
- A GRASP for a difficult single machine scheduling problem
- Assignment and sequencing models for the scheduling of process systems
- An efficient composite heuristic for the symmetric generalized traveling salesman problem
- Scheduling a single machine to minimize a regular objective function under setup constraints
- Greedy randomized adaptive search procedures
- A survey of scheduling problems with setup times or costs
- A hybrid genetic algorithm for the single machine scheduling problem
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
- An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint
- Worst-case performance of approximation algorithms for tool management problems
- A Tactical Planning Model for Mixed-Model Electronics Assembly Operations
