A single machine carryover sequence-dependent group scheduling in PCB manufacturing
From MaRDI portal
Publication:339574
DOI10.1016/j.cor.2012.06.006zbMath1349.90393OpenAlexW2150049961MaRDI QIDQ339574
Rasaratnam Logendran, M. T. Yazdani Sabouni
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.06.006
branch-and-bound algorithmgroup schedulingcarryover sequence-dependent setupskitting timeslower-bounding structurePCB manufacturing
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items
Cites Work
- Group-scheduling problems in electronics manufacturing
- Group technology approach to the open shop scheduling problem with batch setup times
- Breadth-first heuristic search
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- Principles of Sequencing and Scheduling
- Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
- State-Space Search
- Scheduling