Block models for scheduling jobs on two parallel machines with a single server

DOI10.1016/J.COR.2013.08.015zbMATH Open1348.90270OpenAlexW2004467690WikidataQ57633797 ScholiaQ57633797MaRDI QIDQ336766FDOQ336766

Authors: Keramat Hasani, Svetlana A. Kravchenko, Frank Werner 

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.08.015

Recommendations

• MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server
• Scheduling parallel machines with a single server: Some solvable cases and heuristics
• Parallel machine scheduling with a single server: loading and unloading
• A branch-and-price algorithm for the general case of scheduling parallel machines with a single server
• Scheduling two parallel machines with a single server: the general case

zbMATH Keywords

schedulingparallel machinessingle server

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

Cites Work

• Parallel machine scheduling with a common server
• Complexity results for parallel machine problems with a single server
• A branch-and-price algorithm for the general case of scheduling parallel machines with a single server
• Scheduling two parallel machines with a single server: the general case
• Scheduling parallel machines with a single server: Some solvable cases and heuristics
• Scheduling with multiple servers

Cited In (5)

• Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations
• 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 multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen
• Minimization of maximum lateness on parallel machines with a single server and job release dates
• MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server

This page was built for publication: Block models for scheduling jobs on two parallel machines with a single server

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