Total completion time with makespan constraint in no-wait flowshops with setup times

DOI10.1016/j.ejor.2014.04.031zbMath1338.90156OpenAlexW2084114854MaRDI QIDQ296867

Harun Aydilek, Ali Allahverdi

Publication date: 23 June 2016

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.04.031

zbMATH Keywords

schedulingmakespantotal completion timesetup timesno-wait flowshop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (10)

Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time ⋮ The third comprehensive survey on scheduling problems with setup times/costs ⋮ A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm ⋮ Shop scheduling in manufacturing environments: a review ⋮ A memetic algorithm for restoring feasibility in scheduling with limited makespan ⋮ No-wait flowshop scheduling problem with two criteria; total tardiness and makespan ⋮ A survey of scheduling problems with no-wait in process ⋮ Dynamic facility layout problem based on open queuing network theory ⋮ Scheduling with time-of-use costs ⋮ No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan

Cites Work

• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
• Single machine scheduling problem with interval processing times to minimize mean weighted completion time
• Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
• Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop
• Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
• A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times
• A self-guided genetic algorithm for permutation flowshop scheduling problems
• Heuristics for no-wait flowshops with makespan subject to mean completion time
• Discrete Self-Organising Migrating Algorithm for flow-shop scheduling with no-wait makespan
• The significance of reducing setup times/setup costs
• A survey of scheduling problems with setup times or costs
• Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
• New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• 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
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: Total completion time with makespan constraint in no-wait flowshops with setup times