Flow shop scheduling with heterogeneous workers
From MaRDI portal
Publication:2254003
DOI10.1016/j.ejor.2014.02.012zbMath1304.90086OpenAlexW2029346708MaRDI QIDQ2254003
Marcus Ritt, Cristóbal Miralles, Alexander J. Benavides
Publication date: 4 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.02.012
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
An \(M/G/2\) queue where customers are served subject to a minimum violation of FCFS queue discipline, Workforce planning incorporating skills: state of the art, Modelling and a hybrid genetic algorithm for the equity-oriented worker assignment problem in seru production systems, Developing optimization \& robust models for a mixed-model assembly line balancing problem with semi-automated operations, A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions, A new mathematical formulation for a potash-mine shift scheduling problem with a simultaneous assignment of machines and workers
Uses Software
Cites Work
- Unnamed Item
- On solving the assembly line worker assignment and balancing problem via beam search
- Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- A new constructive heuristic for the flowshop scheduling problem
- Flow-shop problems with intermediate buffers
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- A comprehensive review and evaluation of permutation flowshop heuristics
- A computational study of the permutation flow shop problem based on a tight lower bound
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Benchmarks for basic scheduling problems
- Fifty years of scheduling: a survey of milestones
- Flowshop sequencing problems with limited buffer storage
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Ordonnancements à contraintes disjonctives
- A New Heuristic for Three-Machine Flow Shop Scheduling
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Stochastic assembly line balancing using beam search
- Tight Bounds for Permutation Flow Shop Scheduling
