The significance of reducing setup times/setup costs

DOI10.1016/J.EJOR.2006.09.010MaRDI QIDQ2467248zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The third comprehensive survey on scheduling problems with setup times/costs
• Survey of scheduling research involving setup times
• A survey of scheduling problems with setup times or costs
• Impact of sequence-dependent setup time on job shop scheduling performance
• Modelling setup times in project scheduling

Cites work

• scientific article; zbMATH DE number 3425355 (Why is no real title available?)
• A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times
• A hybrid two-stage flowshop with part family, batch production, major and minor set-ups
• A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots
• Group technology in a hybrid flowshop environment: a case study
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Interceptors for Java remote method invocation
• Parallel machine scheduling with a common server
• Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints
• Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
• The Multiple-Family ELSP with Safety Stocks

Cited in

(39)

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

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)