Flowshop sequencing with mean flowtime objective
From MaRDI portal
Publication:1130072
DOI10.1016/0377-2217(93)E0353-YzbMath0912.90173OpenAlexW2040815373MaRDI QIDQ1130072
Publication date: 16 August 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0353-y
Related Items
Trade-off balancing in scheduling for flow shop production and perioperative processes, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime, Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs., A bicriteria flowshop scheduling with a learning effect, An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion, Comparison of heuristics for flowtime minimisation in permutation flowshops, Flow shops with WIP and value added costs, A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs, Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem, Heuristics for scheduling in a flow shop with multiple processors, A hybrid genetic local search algorithm for the permutation flowshop scheduling problem, An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs, A robust two-machine flow-shop scheduling model with scenario-dependent processing times, A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs, Some results of the worst-case analysis for flow shop scheduling, Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation, A comparative study of dispatching rules in dynamic flowshops and jobshops
Cites Work
- Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- A new heuristic for the n-job, M-machine flow-shop problem
- Optimal two- and three-stage production schedules with setup times included
- On general routing problems
- An Evaluation of Flow Shop Sequencing Heuristics
- AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
- The Complexity of Flowshop and Jobshop Scheduling
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
- A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
