Scheduling for parallel dedicated machines with a single server

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6750(200006)47:4<304::AID-NAV3>3.0.CO;2-1" /><304::AID-NAV3>3.0.CO;2-1 10.1002/(SICI)1520-6750(200006)47:4<304::AID-NAV3>3.0.CO;2-1zbMath0968.90036OpenAlexW2037710298MaRDI QIDQ4488782

Yakov M. Shafransky, Celia A. Dr. Glass, Vitaly A. Strusevich

Publication date: 9 July 2000

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(200006)47:4<304::aid-nav3>3.0.co;2-1

zbMATH Keywords

complexityschedulingapproximationsingle serverparallel dedicated machines

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (27)

Total completion time minimization in a computer system with a server and two parallel processors ⋮ 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 ⋮ Scheduling jobs with equal processing times and a single server on parallel identical machines ⋮ Two-machine open shop problem with a single server and set-up time considerations ⋮ Two-machine flow shop problems with a single server ⋮ Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen ⋮ A job-shop problem with one additional resource type ⋮ Scheduling problems for parallel dedicated machines under multiple resource constraints. ⋮ Scheduling the two-machine open shop problem under resource constraints for setting the jobs ⋮ A survey of scheduling problems with setup times or costs ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server ⋮ Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic ⋮ Complexity results for flow-shop problems with a single server ⋮ Parallel machine scheduling with multiple unloading servers ⋮ Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers ⋮ Scheduling in manufacturing with transportation: classification and solution techniques ⋮ Solving the two-machine open shop problem with a single server with respect to the makespan ⋮ Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times ⋮ Minimization of maximum lateness on parallel machines with a single server and job release dates ⋮ Scheduling reentrant jobs on parallel machines with a remote server ⋮ The single-processor scheduling problem with time restrictions: complexity and related problems ⋮ Parallel machine scheduling with a common server ⋮ A review of TSP based approaches for flowshop scheduling ⋮ Complexity results for parallel machine problems with a single server ⋮ Scheduling parallel dedicated machines under a single non-shared resource ⋮ Parallel machine scheduling with additional resources: notation, classification, models and solution methods

Cites Work

• The Three-Machine No-Wait Flow Shop is NP-Complete
• Open Shop Scheduling to Minimize Finish Time

This page was built for publication: Scheduling for parallel dedicated machines with a single server