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

DOI10.1007/s40305-019-00268-7zbMath1474.90169OpenAlexW2982305981MaRDI QIDQ2033983

Yanyan Li

Publication date: 18 June 2021

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-019-00268-7

zbMATH Keywords

schedulingrelease timepolynomial-time approximation schemedelivery timenested eligibility constraints

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast approximation algorithms for job scheduling with processing set restrictions
• Approximation algorithms for scheduling unrelated parallel machines
• Search tree based approaches for parallel machine scheduling
• Scheduling parallel machines with inclusive processing set restrictions and job release times
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• Minimizing makespan on parallel machines subject to release dates and delivery times
• Parallel machine scheduling with nested processing set restrictions and job delivery times
• Polynomial time approximation algorithms for machine scheduling: Ten open problems
• Parallel machine scheduling under a grade of service provision
• Parallel machine scheduling with nested job assignment restrictions
• Efficient approximation schemes for scheduling problems with release dates and delivery times
• An optimal rounding gives a better approximation for scheduling unrelated machines
• Scheduling unit length jobs with parallel nested machine processing set restrictions
• Parallel machine scheduling with nested processing set restrictions
• Scheduling parallel machines with inclusive processing set restrictions
• Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
• Task Scheduling on a Multiprocessor System with Independent Memories
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Some simple scheduling algorithms
• A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
• Parallel machine scheduling with job assignment restrictions

This page was built for publication: Scheduling jobs with release and delivery times subject to nested eligibility constraints