Minimizing the number of workers in a paced mixed-model assembly line
From MaRDI portal
Publication:1991120
DOI10.1016/j.ejor.2018.05.072zbMath1403.90284OpenAlexW2805489441WikidataQ129729850 ScholiaQ129729850MaRDI QIDQ1991120
Sergey Kovalev, Xavier Delorme, Mikhail Y. Kovalyov, Alexandre Dolgui
Publication date: 30 October 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://hal-emse.ccsd.cnrs.fr/emse-01840007/file/WorkersTSP%209%20March.pdf
Abstract computational complexity for mathematical programming problems (90C60) Production models (90B30) Combinatorial optimization (90C27)
Related Items (2)
An improved approximation algorithm for scheduling monotonic moldable tasks ⋮ Stochastic mixed-model assembly line sequencing problem: mathematical modeling and Q-learning based simulated annealing hyper-heuristics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Workforce planning incorporating skills: state of the art
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
- The basic cyclic scheduling problem with deadlines
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
- A general model for cyclic machine scheduling problems
- High-multiplicity cyclic job shop scheduling
- Efficiently solvable special cases of bottleneck travelling salesman problems
- Traveling salesman problem under categorization
- An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices
- On Gilmore-Gomory's open question for the bottleneck TSP.
- The complexity of cyclic shop scheduling problems
- Optimal workforce assignment to operations of a paced assembly line
- An efficient bicriteria algorithm for stable robotic flow shop scheduling
- New approximation results for the maximum scatter TSP
- Efficient algorithms for periodic scheduling
- Simple algorithms for gilmore-gomory's traveling salesman and related problems
- Construction of cyclic schedules in presence of parallel machines
- On cyclic sequence types for constructing cyclic schedules
- Formulation of a problem involving assembly lines with multiple manning of work stations
- Cyclic Scheduling via Integer Programs with Circular Ones
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
- On the Maximum Scatter Traveling Salesperson Problem
- Workforce Planning in Mixed Model Assembly Systems
- Level workforce planning for multistage transfer lines
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Cyclic job scheduling in paced assembly lines with cross-trained workers
- Workface planning in synchronous production systems
This page was built for publication: Minimizing the number of workers in a paced mixed-model assembly line
