Optimal versus heuristic scheduling of surface mount technology lines
From MaRDI portal
Publication:3159686
DOI10.1080/002075403010001647604zbMath1094.90557OpenAlexW2088101175MaRDI QIDQ3159686
Andreas Schaller, Thomas M. Tirpak, Waldemar Kaczmarczyk, Tadeusz J. Sawik
Publication date: 16 February 2005
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/002075403010001647604
Related Items (5)
Hierarchical approach to production scheduling in make-to-order assembly ⋮ A lexicographic approach to bi-objective scheduling of single-period orders in make-to-order manufacturing ⋮ A memetic algorithm for the flexible flow line scheduling problem with processor blocking ⋮ The hybrid flow shop scheduling problem ⋮ A multi‐objective customer orders assignment and resource leveling in make‐to‐order manufacturing
Cites Work
- Batch scheduling in a two-machine flow shop with limited buffer
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
- Minimizing makespan in hybrid flowshops
- The flow shop with parallel machines: A tabu search approach
- Scheduling with limited machine availability
- Optimal two- and three-stage production schedules with setup times included
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- Flowshop scheduling with limited temporary storage
- Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs: Part 2
- Implementing Setup Optimization on the Shop Floor
- An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer
- Minimizing Cycle Time in a Blocking Flowshop
- A Tactical Planning Model for Mixed-Model Electronics Assembly Operations
- Mixed integer programming for scheduling surface mount technology lines
- Component Fixture Positioning/Sequencing for Printed Circuit Board Assembly with Concurrent Operations
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Cyclic scheduling in flow lines: Modeling observations, effective heuristics and a cycle time minimization procedure
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
This page was built for publication: Optimal versus heuristic scheduling of surface mount technology lines
