Pages that link to "Item:Q4488782"

The following pages link to Scheduling for parallel dedicated machines with a single server (Q4488782):

Displaying 35 items.

• Scheduling jobs with equal processing times and a single server on parallel identical machines (Q313819) (← links)
• Scheduling a single server in a two-machine flow shop (Q424733) (← links)
• Scheduling with multiple servers (Q612219) (← links)
• A job-shop problem with one additional resource type (Q640303) (← links)
• Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic (Q709121) (← links)
• Two-machine flow shop problems with a single server (Q880567) (← links)
• Parallel machine scheduling problems with a single server (Q969356) (← links)
• Parallel machine scheduling with multiple unloading servers (Q983625) (← links)
• Scheduling reentrant jobs on parallel machines with a remote server (Q1010265) (← links)
• Scheduling problems for parallel dedicated machines under multiple resource constraints. (Q1417559) (← links)
• Parallel machine scheduling with a common server (Q1566574) (← 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)
• 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)
• Complexity results for parallel machine problems with a single server (Q1860370) (← links)
• Scheduling parallel dedicated machines under a single non-shared resource (Q1869718) (← links)
• Equal processing and equal setup time cases of scheduling parallel machines with a single server (Q1885956) (← links)
• Total completion time minimization in a computer system with a server and two parallel processors (Q1886864) (← links)
• Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers (Q2026982) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• The single-processor scheduling problem with time restrictions: complexity and related problems (Q2304117) (← links)
• Parallel machine scheduling with additional resources: notation, classification, models and solution methods (Q2356015) (← links)
• Scheduling the two-machine open shop problem under resource constraints for setting the jobs (Q2449360) (← links)
• A survey of scheduling problems with setup times or costs (Q2467249) (← links)
• The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time (Q2475853) (← links)
• Scheduling two parallel machines with a single server: the general case (Q2571191) (← links)
• A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
• Two-machine open shop problem with a single server and set-up time considerations (Q2663040) (← links)
• Scheduling a single server and equal processing times in a two-machine flow-shop (Q2858858) (← links)
• Server scheduling on parallel dedicated machines with fixed job sequences (Q5228511) (← 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)
• Scheduling in manufacturing with transportation: classification and solution techniques (Q6586212) (← links)
• Solving the two-machine open shop problem with a single server with respect to the makespan (Q6588513) (← links)
• Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times (Q6602333) (← links)
• Minimization of maximum lateness on parallel machines with a single server and job release dates (Q6614640) (← links)