Pages that link to "Item:Q883307"

The following pages link to Scheduling unrelated parallel machines with sequence-dependent setups (Q883307):

Displaying 19 items.

• The third comprehensive survey on scheduling problems with setup times/costs (Q319774) (← links)
• Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752) (← links)
• Bicriteria scheduling problem for unrelated parallel machines with release dates (Q342063) (← links)
• Planning production using mathematical programming: The case of a woodturning company (Q1013389) (← links)
• Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study (Q1651526) (← 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)
• 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)
• A variable neighborhood descent as ILS local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times (Q1791956) (← links)
• An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics (Q2273664) (← links)
• A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times (Q2285809) (← links)
• Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines (Q2290308) (← links)
• Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines (Q2297569) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• A comparative study of solution representations for the unrelated machines environment (Q2664345) (← links)
• The traveling salesman problem with job-times (\textit{TSPJ}) (Q2668643) (← 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)
• A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization (Q6114940) (← links)
• Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates (Q6554640) (← links)