Parallel machine scheduling with nested processing set restrictions and job delivery times

DOI10.1155/2016/3203728zbMath1400.90171OpenAlexW2519331049WikidataQ59130827 ScholiaQ59130827MaRDI QIDQ1792963

Shuguang Li

Publication date: 12 October 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2016/3203728

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Scheduling jobs with release and delivery times subject to nested eligibility constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Fast approximation algorithms for job scheduling with processing set restrictions
• Heuristics for parallel machine scheduling with delivery times
• Parallel machine scheduling with nested job assignment restrictions
• Efficient approximation schemes for scheduling problems with release dates and delivery times
• Parallel machine scheduling with nested processing set restrictions
• PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel machine scheduling with job assignment restrictions
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: Parallel machine scheduling with nested processing set restrictions and job delivery times