Scheduling jobs with equal processing times and a single server on parallel identical machines

DOI10.1016/J.DAM.2016.05.014MaRDI QIDQ313819zbMATH OpenOpenAlexFDO

Authors An Zhang, Hongjun Wang, Yong Chen, Guang-Ting Chen

Publication date 12 September 2016

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2016.05.014

zbMATH Keywords

worst-case analysisparallel machine schedulingsingle serverSPT algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling jobs with equal processing times and time windows on identical parallel machines
• Scheduling equal-length jobs on identical parallel machines
• Scheduling identical jobs on uniform parallel machines
• Equal processing and equal setup time cases of scheduling parallel machines with a single server
• On a parallel machine scheduling problem with equal processing times
• Batch scheduling of identical jobs on parallel identical machines
• Scheduling Equal-Length Jobs with Delivery times on Identical Processors
• Scheduling jobs on identical and uniform processors revisited
• Identical parallel machine scheduling with time-dependent processing times

Cites work

• A heuristic algorithm for minimizing mean flow time with unit setups
• A survey of scheduling problems with setup times or costs
• An approximation algorithm for parallel machine scheduling with a common server
• Complexity results for flow-shop problems with a single server
• Complexity results for parallel machine problems with a single server
• Minimizing total weighted completion time approximately for the parallel machine problem with a single server
• On a two-machine flow-shop scheduling problem with a single server and unit processing times
• Parallel machine scheduling problems with a single server
• Parallel machine scheduling with a common server
• Parallel machine scheduling with multiple unloading servers
• Scheduling a single server in a two-machine flow shop
• Scheduling for parallel dedicated machines with a single server
• Single-server parallel-machine scheduling with loading and unloading times

Cited in

(10)

• Scheduling to minimize the maximum total completion time per machine
• An optimal preemptive algorithm for the single-server parallel-machine scheduling with loading and unloading times
• 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 within time windows on identical parallel machines: New model and algorithms
• Minimization of maximum lateness on parallel machines with a single server and job release dates
• scientific article; zbMATH DE number 1530325 (Why is no real title available?)
• Shop scheduling in manufacturing environments: a review
• Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
• Scheduling a single server and equal processing times in a two-machine flow-shop
• Minimizing total weighted completion time approximately for the parallel machine problem with a single server

This page was built for publication: Scheduling jobs with equal processing times and a single server on parallel identical machines

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