No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan

DOI10.1016/J.AMC.2019.124688MaRDI QIDQ2284308zbMATH OpenOpenAlexWikidataFDO

Authors Ali Allahverdi, Harun Aydilek, Asiye Aydilek

Publication date 14 January 2020

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2019.124688

zbMATH Keywords

makespanno-wait flowshopschedulingsetup timestotal tardiness

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
• Total completion time with makespan constraint in no-wait flowshops with setup times
• Minimizing total tardiness in no-wait flowshops
• Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated
• Some effective heuristics for no-wait flowshops with setup times to minimize total completion time

Cites work

• A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• A survey of scheduling problems with no-wait in process
• General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Heuristics for no-wait flowshops with makespan subject to mean completion time
• Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times
• Minimizing total tardiness in no-wait flowshops
• Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
• NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
• New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
• No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
• No-wait flowshops with bicriteria of makespan and maximum lateness.
• Order scheduling with tardiness objective: improved approximate solutions
• Some heuristics for no-wait flowshops with total tardiness criterion
• Some new results in flow shop scheduling
• The significance of reducing setup times/setup costs
• The third comprehensive survey on scheduling problems with setup times/costs
• Total completion time minimization in a computer system with a server and two parallel processors
• Total completion time with makespan constraint in no-wait flowshops with setup times
• Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated
• Total flowtime in no-wait flowshops with separated setup times.
• Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness

Cited in

(18)

• No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
• A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach
• Total completion time with makespan constraint in no-wait flowshops with setup times
• Minimizing total tardiness in no-wait flowshops
• The flow shop problem with time lags and separated setup times
• No-wait flowshops with bicriteria of makespan and total completion time
• Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated
• scientific article; zbMATH DE number 5247431 (Why is no real title available?)
• Shop scheduling in manufacturing environments: a review
• Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times
• Intelligent optimization under the makespan constraint: rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem
• A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness
• An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times
• A reactive iterated greedy algorithm for the no-wait flowshop to minimize total tardiness
• An ALNS to optimize makespan subject to total completion time for no-wait flow shops with sequence-dependent setup times
• Minimising makespan and total tardiness for the flowshop group scheduling problem with sequence dependent setup times
• A Q-learning-based variable greedy algorithm to minimize the sum of total earliness and tardiness in a no-wait flowshop scheduling problem
• The fourth comprehensive review of scheduling problems with setup times

This page was built for publication: No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan

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