Pages that link to "Item:Q941547"

The following pages link to Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times (Q941547):

Displaying 37 items.

• The third comprehensive survey on scheduling problems with setup times/costs (Q319774) (← links)
• Optimizing emergency preparedness and resource utilization in mass-casualty incidents (Q323561) (← links)
• Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752) (← links)
• ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times (Q337126) (← links)
• Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines (Q670464) (← links)
• Robust scheduling of parallel machines with sequence-dependent set-up costs (Q706962) (← links)
• Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints (Q833543) (← links)
• A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times (Q853028) (← links)
• Mathematical model applied to single-track line scheduling problem in Brazilian railways (Q904294) (← links)
• An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times (Q968014) (← links)
• A scheduling problem with unrelated parallel machines and sequence dependent setups (Q973463) (← links)
• Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration (Q983631) (← links)
• Planning production using mathematical programming: The case of a woodturning company (Q1013389) (← links)
• A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (Q1046712) (← links)
• Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times (Q1628056) (← 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 hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem (Q1692274) (← links)
• Exact methods for order acceptance and scheduling on unrelated parallel machines (Q1725610) (← 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)
• Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints (Q1762106) (← links)
• A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times (Q1919357) (← links)
• On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date (Q1926635) (← links)
• A new heuristic and an exact approach for a production planning problem (Q2051214) (← links)
• Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times (Q2147050) (← links)
• Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times (Q2243380) (← links)
• Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines (Q2297569) (← links)
• Simultaneous lotsizing and scheduling problems: a classification and review of models (Q2362236) (← links)
• Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach (Q2370333) (← links)
• Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time (Q2439496) (← links)
• Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time (Q2448135) (← links)
• A comparative study of solution representations for the unrelated machines environment (Q2664345) (← links)
• Unrelated parallel machine scheduling problem with special controllable processing times and setups (Q2676390) (← links)
• Decomposition methods for the parallel machine scheduling problem with setups (Q2806866) (← links)
• Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization (Q2958668) (← links)
• Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times (Q6070133) (← links)
• Exact approaches to late work scheduling on unrelated machines (Q6093431) (← links)
• An exact branch-and-bound algorithm for \textit{seru} scheduling problem with sequence-dependent setup time and release date (Q6149341) (← links)