Approximation algorithms for the three-machine proportionate mixed shop scheduling

DOI10.1016/j.tcs.2019.05.036zbMath1444.90055arXiv1809.05745OpenAlexW2953662409WikidataQ127565663 ScholiaQ127565663MaRDI QIDQ2283006

Yue Luo, Randy Goebel, Longcheng Liu, Guanqun Ni, Yao Xu, Yong Chen, Bing Su, An Zhang, Jianming Dong, Guo-Hui Lin

Publication date: 27 December 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.05745

zbMATH Keywords

schedulingapproximation algorithmfully polynomial time approximation schememixed shop problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ The LPT heuristic for minimizing total load on a proportionate openshop ⋮ On the complexity of proportionate open shop and job shop problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The three-machine proportionate open shop and mixed shop minimum makespan problems
• Scheduling ordered open shops
• The mixed shop scheduling problem
• Scheduling two jobs with fixed and nonfixed routes
• Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
• Complexity of mixed shop scheduling problems: A survey
• Review of the ordered and proportionate flow shop scheduling research
• Focused Scheduling in Proportionate Flowshops
• On J -maximal and J -minimal Flow-Shop Schedules
• Two-Machine Super-Shop Scheduling Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Approximation algorithms for the three-machine proportionate mixed shop scheduling