Group-scheduling problems in electronics manufacturing
From MaRDI portal
Recommendations
- Integer programming approach to the printed circuit board grouping problem
- Three perspectives for solving the job grouping problem
- Grouping components in printed circuit board assembly with limited component staging capacity and single card setup: Problem characteristics and solution procedures
- Optimal versus heuristic scheduling of surface mount technology lines
- Printed circuit board family grouping and component allocation for a multimachine, open-shop assembly cell
Cites work
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
- A Tabu search-based approach for scheduling job-shop type flexible manufacturing systems
- A Tactical Planning Model for Mixed-Model Electronics Assembly Operations
- A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover
- An exact algorithm for IP column generation
- Branch-and-price: Column generation for solving huge integer programs
- Design and analysis of experiments.
- Designing and reporting on computational experiments with heuristic methods
- Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
- Group technology approach to the open shop scheduling problem with batch setup times
- Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
- Needed: An Empirical Science of Algorithms
- Parallel machine scheduling by column generation
- Production planning problems in printed circuit board assembly
- Solving Parallel Machine Scheduling Problems by Column Generation
- Stabilized column generation
- Statistical Analysis of Computational Tests of Algorithms and Heuristics
- The Complexity of Flowshop and Jobshop Scheduling
- The capacitated lot-sizing problem with linked lot sizes
Cited in
(8)- An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
- Integer programming approach to the printed circuit board grouping problem
- The third comprehensive survey on scheduling problems with setup times/costs
- A single machine carryover sequence-dependent group scheduling in PCB manufacturing
- A comprehensive review of flowshop group scheduling literature
- Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem
- Three perspectives for solving the job grouping problem
- An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes
This page was built for publication: Group-scheduling problems in electronics manufacturing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q964869)
