Pages that link to "Item:Q2467248"

The following pages link to The significance of reducing setup times/setup costs (Q2467248):

Displaying 35 items.

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