The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime

DOI10.1016/S0377-2217(02)00253-9MaRDI QIDQ1869720zbMATH OpenFDO

Authors Ali Allahverdi

Publication date 28 April 2003

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0377-2217(02)00253-9

zbMATH Keywords

bicriteriadominanceFlowshopheuristicsmakespanmean flowtimerelation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
• The tricriteria two-machine flowshop scheduling problem
• No-wait flowshops with bicriteria of makespan and total completion time
• Two-Stage Flowshop Scheduling Problem with Bicriteria
• A bicriteria approach to the two-machine flow shop scheduling problem

Cites work

• A bicriteria approach to the two-machine flow shop scheduling problem
• A bicriteria two-machine permutation flowshop problem
• A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
• A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
• A heuristic algorithm for mean flowtime objective in flowshop scheduling
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
• A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem
• A new heuristic for the n-job, M-machine flow-shop problem
• An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Genetic algorithms for the two-stage bicriteria flowshop problem
• Heuristic approaches for n/m/F/ C_i scheduling problems
• Heuristics for scheduling in flowshop with multiple objectives
• Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
• The two-machine total completion time flow shop problem
• Two-Stage Flowshop Scheduling Problem with Bicriteria

Cited in

(20)

• New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
• A bicriteria two-machine permutation flowshop problem
• Heuristics for scheduling in flowshop with multiple objectives
• A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
• Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
• The tricriteria two-machine flowshop scheduling problem
• Bicriteria optimisation of the makespan and mean flowtime on two identical parallel machines
• A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime
• Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm
• Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem
• TWO-AND THREE-MACHINE FLOW-SHOP MAKESPAN SCHEDULING PROBLEMS WITH ADDITIONAL TIMES SEPARATED FROM PROCESSING TIMES
• A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
• A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
• Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization
• Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
• Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling
• Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
• A bicriteria flowshop scheduling with a learning effect
• Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness
• A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times

This page was built for publication: The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869720)