The significance of reducing setup times/setup costs

DOI10.1016/J.EJOR.2006.09.010zbMATH Open1137.90475OpenAlexW2045998498MaRDI QIDQ2467248FDOQ2467248

Ali Allahverdi, Hossein M. 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)

Cites Work

• Title not available (Why is that?)
• A hybrid two-stage flowshop with part family, batch production, major and minor set-ups
• Parallel machine scheduling with a common server
• A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots
• Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints
• The Multiple-Family ELSP with Safety Stocks
• Group technology in a hybrid flowshop environment: a case study
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
• 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

Cited In (38)

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

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

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