The significance of reducing setup times/setup costs

DOI10.1016/J.EJOR.2006.09.010zbMath1137.90475OpenAlexW2045998498MaRDI QIDQ2467248

Ali Allahverdi, Hossein Soroush

Publication date: 21 January 2008

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

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

zbMATH Keywords

schedulingsetup timesetup cost

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (35)

Non-exhaustive family based dispatching heuristics–exploiting variances of processing and set-up times ⋮ Total completion time with makespan constraint in no-wait flowshops with setup times ⋮ Group-shop scheduling with sequence-dependent set-up and transportation times ⋮ The third comprehensive survey on scheduling problems with setup times/costs ⋮ Preemptive scheduling in a two-stage supply chain to minimize the makespan ⋮ Two-machine open shop problem with a single server and set-up time considerations ⋮ A mixed-integer programming model for an integrated production planning problem with preventive maintenance in the pulp and paper industry ⋮ General variable neighborhood search for the parallel machine scheduling problem with two common servers ⋮ On competitive analysis for polling systems ⋮ Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times ⋮ Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization ⋮ Just-in-Time Planning and Lot-Sizing ⋮ Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times ⋮ The setup carryover assignment problem ⋮ Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis ⋮ Optimizing memory allocation for multistage scheduling including setup times ⋮ A worker constrained flexible job shop scheduling problem with sequence-dependent setup times ⋮ Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines ⋮ A survey of scheduling problems with setup times or costs ⋮ A survey of scheduling problems with no-wait in process ⋮ Classifying and modeling setups and cleanings in lot sizing and scheduling ⋮ Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times ⋮ The hybrid flow shop scheduling problem ⋮ New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness ⋮ Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm ⋮ A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times ⋮ No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan ⋮ Algorithms for a realistic variant of flowshop scheduling ⋮ Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times ⋮ Domino sequencing: scheduling with state-based sequence-dependent setup times ⋮ Planning production using mathematical programming: The case of a woodturning company ⋮ The two-stage assembly scheduling problem to minimize total completion time with setup times ⋮ Optimal and heuristic solution methods for a multiprocessor machine scheduling problem ⋮ Metaheuristic algorithms for balancing robotic assembly lines with sequence-dependent robot setup times ⋮ The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies

Cites Work

• Unnamed Item
• A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots
• A hybrid two-stage flowshop with part family, batch production, major and minor set-ups
• Parallel machine scheduling with a common server
• Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints
• Group technology in a hybrid flowshop environment: a case study
• A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times
• Interceptors for Java Remote Method Invocation
• The Multiple-Family ELSP with Safety Stocks
• Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

This page was built for publication: The significance of reducing setup times/setup costs