Heuristics for scheduling in flowshop with multiple objectives
From MaRDI portal
Publication:1388918
DOI10.1016/0377-2217(93)E0212-GzbMath0905.90107MaRDI QIDQ1388918
Publication date: 2 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime ⋮ A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling ⋮ Solving multi-objective production scheduling problems using metaheuristics ⋮ An exact parallel method for a bi-objective permutation flowshop problem ⋮ An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem ⋮ Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. ⋮ A genetic algorithm for simultaneous optimisation of lot sizing and scheduling in a flow line assembly ⋮ A bicriteria flowshop scheduling with a learning effect ⋮ Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm ⋮ Multicriteria scheduling problems: a survey ⋮ Scheduling in flowshops to minimize total tardiness of jobs ⋮ A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness ⋮ Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study ⋮ A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ A bicriteria approach to the two-machine flow shop scheduling problem ⋮ Analytic evaluation of the expectation and variance of different performance measures of a schedule on a single machine under processing time variability ⋮ Genetic local search for multi-objective flowshop scheduling problems ⋮ A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs ⋮ A bicriteria two-machine permutation flowshop problem ⋮ Some results of the worst-case analysis for flow shop scheduling ⋮ Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation ⋮ Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time ⋮ The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
Cites Work
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- A new heuristic method for the flow shop sequencing problem
- A new heuristic for the n-job, M-machine flow-shop problem
- Optimal two- and three-stage production schedules with setup times included
- An Evaluation of Flow Shop Sequencing Heuristics
- The Complexity of Flowshop and Jobshop Scheduling
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Unnamed Item
