Pages that link to "Item:Q1860370"

The following pages link to Complexity results for parallel machine problems with a single server (Q1860370):

Displaying 27 items.

• Scheduling jobs with equal processing times and a single server on parallel identical machines (Q313819) (← links)
• Block models for scheduling jobs on two parallel machines with a single server (Q336766) (← links)
• Online LPT algorithms for parallel machines scheduling with a single server (Q385479) (← links)
• Scheduling with multiple servers (Q612219) (← links)
• Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic (Q709121) (← links)
• Parallel machine scheduling with multiple unloading servers (Q983625) (← links)
• Scheduling reentrant jobs on parallel machines with a remote server (Q1010265) (← links)
• Operator non-availability periods (Q1041405) (← links)
• A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server (Q1634053) (← links)
• Minimizing the makespan on two identical parallel machines with mold constraints (Q1722974) (← links)
• A branch-and-price algorithm for the general case of scheduling parallel machines with a single server (Q1761158) (← links)
• MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server (Q1761182) (← links)
• Complexity results for flow-shop problems with a single server (Q1772843) (← links)
• The single-processor scheduling problem with time restrictions: complexity and related problems (Q2304117) (← links)
• Single-server parallel-machine scheduling with loading and unloading times (Q2355978) (← links)
• Mixed integer programming formulations for the biomass truck scheduling problem (Q2358168) (← links)
• Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
• Single machine scheduling with small operator-non-availability periods (Q2434272) (← links)
• Minimizing total weighted completion time approximately for the parallel machine problem with a single server (Q2448861) (← links)
• A survey of scheduling problems with setup times or costs (Q2467249) (← links)
• Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints (Q2467264) (← links)
• Scheduling two parallel machines with a single server: the general case (Q2571191) (← links)
• Online algorithms for scheduling two parallel machines with a single server (Q2806439) (← links)
• Parallel Machine Scheduling with a Single Server: Loading and Unloading (Q2867112) (← links)
• An Optimal Preemptive Algorithm for the Single-Server Parallel-Machine Scheduling with Loading and Unloading Times (Q2931175) (← links)
• SCHEDULING ON TWO PARALLEL MACHINES WITH TWO DEDICATED SERVERS (Q5370786) (← links)
• Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen (Q6068710) (← links)