Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
From MaRDI portal
Publication:1847225
DOI10.1016/S0377-2217(01)00278-8zbMath1081.90555OpenAlexW2065768294MaRDI QIDQ1847225
Rafael Ruiz-Usano, Rainer Leisten, Jose M. Framinan
Publication date: 17 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00278-8
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Trade-off balancing in scheduling for flow shop production and perioperative processes ⋮ Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time ⋮ Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm ⋮ A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem ⋮ An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem ⋮ A discrete inter-species cuckoo search for flowshop scheduling problems ⋮ Reduction of permutation flowshop problems to single machine problems using machine dominance relations ⋮ A beam-search-based constructive heuristic for the PFSP to minimise total flowtime ⋮ A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime ⋮ New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem ⋮ A discrete version of particle swarm optimization for flowshop scheduling problems ⋮ The seeds of the NEH algorithm: an overview using bibliometric analysis ⋮ Generating outpatient chemotherapy appointment templates with balanced flowtime and makespan ⋮ An improved NEH-based heuristic for the permutation flowshop problem ⋮ Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem ⋮ A bicriteria flowshop scheduling with a learning effect ⋮ Comparison of heuristics for flowtime minimisation in permutation flowshops ⋮ A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria ⋮ Bicriteria train scheduling for high-speed passenger railroad planning applications ⋮ A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Some efficient heuristic methods for the flow shop sequencing problem
- Multiple and bicriteria scheduling: A literature survey
- Flowshop sequencing with mean flowtime objective
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- A bicriteria two-machine permutation flowshop problem
- Heuristics for scheduling in flowshop with multiple objectives
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- A bicriteria approach to the two-machine flow shop scheduling problem
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Benchmarks for basic scheduling problems
- A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem
- Two-Stage Flowshop Scheduling Problem with Bicriteria
- 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
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
