Pages that link to "Item:Q2467249"

The following pages link to A survey of scheduling problems with setup times or costs (Q2467249):

Displaying 50 items.

• Algorithms for a realistic variant of flowshop scheduling (Q732880) (← links)
• Total flow time minimization in a flowshop sequence-dependent group scheduling problem (Q733546) (← links)
• Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns (Q829166) (← links)
• Exact method for the two-machine flow-shop problem with time delays (Q829189) (← links)
• Batch scheduling of step deteriorating jobs (Q835578) (← links)
• A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times (Q879286) (← links)
• Batching deteriorating items with applications in computer communication and reverse logistics (Q884021) (← links)
• Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times (Q892912) (← links)
• Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269) (← links)
• Batch scheduling in a two-stage flexible flow shop problem (Q902743) (← links)
• Mathematical model applied to single-track line scheduling problem in Brazilian railways (Q904294) (← links)
• Scheduling with returnable containers (Q906554) (← links)
• Scheduling at coal handling facilities using simulated annealing (Q953296) (← links)
• A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria (Q954034) (← links)
• Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness (Q958459) (← links)
• A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times (Q967801) (← links)
• Online scheduling of malleable parallel jobs with setup times on two identical machines (Q976487) (← links)
• Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time (Q980257) (← links)
• Shifting representation search for hybrid flexible flowline problems (Q992723) (← links)
• A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times (Q1000975) (← links)
• Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan (Q1010280) (← links)
• A simulated annealing algorithm for single machine scheduling problems with family setups (Q1013384) (← 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)
• Scheduling with families of jobs and delivery coordination under job availability (Q1034606) (← links)
• Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan (Q1038382) (← links)
• Minimizing total weighted completion time on single machine with past-sequence-dependent setup times and exponential time-dependent and position-dependent learning effects (Q1040180) (← links)
• Group-shop scheduling with sequence-dependent set-up and transportation times (Q1634110) (← links)
• A study on integration of lot sizing and flow shop lot streaming problems (Q1637796) (← links)
• A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times (Q1643055) (← links)
• A comprehensive review of flowshop group scheduling literature (Q1651625) (← links)
• An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes (Q1652033) (← links)
• A note on a single-machine lot scheduling problem with indivisible orders (Q1652143) (← links)
• Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties (Q1652242) (← links)
• Equilibrium customer strategies in the queue with threshold policy and setup times (Q1665462) (← links)
• Lot-order assignment applying priority rules for the single-machine total tardiness scheduling with nonnegative time-dependent processing times (Q1665667) (← links)
• An improved particle swarm optimization for selective single machine scheduling with sequence dependent setup costs and downstream demands (Q1666342) (← links)
• Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning (Q1667775) (← links)
• Solving the flexible job shop scheduling problem with sequence-dependent setup times (Q1681272) (← links)
• A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness (Q1683059) (← links)
• A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem (Q1692274) (← links)
• Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times (Q1694317) (← links)
• Splitting versus setup trade-offs for scheduling to minimize weighted completion time (Q1694777) (← links)
• Optimizing memory allocation for multistage scheduling including setup times (Q1702728) (← links)
• Bounds for parallel machine scheduling with predefined parts of jobs and setup time (Q1708539) (← links)
• Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm (Q1725624) (← links)
• Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives (Q1730482) (← links)
• A worker constrained flexible job shop scheduling problem with sequence-dependent setup times (Q1733093) (← links)
• Feasibility recovery for the unit-capacity constrained permutation problem (Q1751174) (← links)