Pages that link to "Item:Q1628056"

The following pages link to Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times (Q1628056):

Displaying 25 items.

• Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals (Q322736) (← links)
• Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines (Q670464) (← links)
• Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times (Q941547) (← links)
• Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations (Q1038328) (← links)
• On modelling the maximum workload allocation for parallel unrelated machines with setups (Q1309883) (← links)
• Algorithms for the unrelated parallel machine scheduling problem with a resource constraint (Q1653364) (← links)
• Exact methods for order acceptance and scheduling on unrelated parallel machines (Q1725610) (← links)
• Heuristic methods for the identical parallel machine flowtime problem with set-up times (Q1772875) (← links)
• Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization (Q2029254) (← links)
• Bi-objective parallel machine scheduling with additional resources during setups (Q2030593) (← links)
• Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect (Q2060398) (← links)
• Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling (Q2108101) (← links)
• Meta-heuristic solution with considering setup time for multi-skilled project scheduling problem (Q2120134) (← links)
• On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
• The traveling salesman problem with job-times (\textit{TSPJ}) (Q2668643) (← links)
• Unrelated parallel machine scheduling with new criteria: complexity and models (Q2668730) (← 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)
• Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines (Q5419000) (← links)
• A Hybrid Bounding Procedure for the Workload Allocation Problem on Parallel Unrelated Machines with Setups (Q5690253) (← links)
• The split delivery vehicle routing problem with time windows and three-dimensional loading constraints (Q6065202) (← links)
• Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem (Q6164382) (← links)
• Unrelated parallel machine energy-efficient scheduling considering sequence-dependent setup times and time-of-use electricity tariffs (Q6491320) (← links)
• A fix-and-optimize heuristic for the unrelated parallel machine scheduling problem (Q6551102) (← links)
• Scheduling heating tasks on parallel furnaces with setup times and conflicts (Q6606697) (← links)