Scheduling for parallel dedicated machines with a single server

DOI10.1002/(SICI)1520-6750(200006)47:4%3C304::AID-NAV3%3E3.0.CO;2-1MaRDI QIDQ4488782zbMATH OpenOpenAlexFDO

Authors Y. Shafransky, C. A. Glass, V. A. Strusevich

Publication date 9 July 2000

Full work available at URL https://doi.org/10.1002/(sici)1520-6750(200006)47:4%3C304::aid-nav3%3E3.0.co;2-1

zbMATH Keywords

approximationcomplexityparallel dedicated machinesschedulingsingle server

Mathematics Subject Classification ID

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

Recommendations

• Scheduling parallel machines with a single server: Some solvable cases and heuristics
• Parallel machine scheduling problems with a single server
• Equal processing and equal setup time cases of scheduling parallel machines with a single server
• Complexity results for parallel machine problems with a single server
• Scheduling with multiple servers

Cites work

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

Cited in

(39)

• Scheduling reentrant jobs on parallel machines with a remote server
• Scheduling problems for parallel dedicated machines under multiple resource constraints.
• Parallel machine scheduling with a common server
• 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
• MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server
• Complexity results for flow-shop problems with a single server
• Complexity results for parallel machine problems with a single server
• Scheduling parallel dedicated machines under a single non-shared resource
• Equal processing and equal setup time cases of scheduling parallel machines with a single server
• Total completion time minimization in a computer system with a server and two parallel processors
• Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• The single-processor scheduling problem with time restrictions: complexity and related problems
• Parallel machine scheduling with additional resources: notation, classification, models and solution methods
• Scheduling the two-machine open shop problem under resource constraints for setting the jobs
• A survey of scheduling problems with setup times or costs
• The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time
• Scheduling two parallel machines with a single server: the general case
• A review of TSP based approaches for flowshop scheduling
• Two-machine open shop problem with a single server and set-up time considerations
• Scheduling a single server and equal processing times in a two-machine flow-shop
• Scheduling jobs with equal processing times and a single server on parallel identical machines
• Scheduling a single server in a two-machine flow shop
• Server scheduling on parallel dedicated machines with fixed job sequences
• Scheduling on two parallel machines with two dedicated servers
• Scheduling parallel machines with a single server: Some solvable cases and heuristics
• Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen
• Scheduling with multiple servers
• A job-shop problem with one additional resource type
• 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
• Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server
• Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic
• Robotic flow shop scheduling problem with combined buffer conditions
• Two-machine flow shop problems with a single server
• Parallel machine scheduling problems with a single server
• Parallel machine scheduling with multiple unloading servers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4488782)