Scheduling jobs with release and delivery times subject to nested eligibility constraints
type: Item
instance of: scholarly article
title: Scheduling jobs with release and delivery times subject to nested eligibility constraints
zbMATH Open document ID: 1474.90169
author: Yanyan Li
published in: Journal of the Operations Research Society of China
publication date: 2021-06-18T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 7361009
zbMATH Keywords: scheduling
zbMATH Keywords: nested eligibility constraints
zbMATH Keywords: release time
zbMATH Keywords: delivery time
zbMATH Keywords: polynomial-time approximation scheme
MaRDI profile type: Publication
full work available at URL: s40305-019-00268-7
OpenAlex ID: W2982305981
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: An optimal rounding gives a better approximation for scheduling unrelated machines
cites work: Polynomial time approximation algorithms for machine scheduling: Ten open problems
cites work: Q3579372
cites work: Q4247460
cites work: Task Scheduling on a Multiprocessor System with Independent Memories
cites work: Parallel machine scheduling under a grade of service provision
cites work: Parallel machine scheduling with job assignment restrictions
cites work: Scheduling parallel machines with inclusive processing set restrictions
cites work: Scheduling parallel machines with inclusive processing set restrictions and job release times
cites work: Parallel machine scheduling with nested processing set restrictions
cites work: Fast approximation algorithms for job scheduling with processing set restrictions
cites work: Parallel machine scheduling with nested job assignment restrictions
cites work: Scheduling unit length jobs with parallel nested machine processing set restrictions
cites work: Parallel machine scheduling with nested processing set restrictions and job delivery times
cites work: Q4821818
cites work: Q4124328
cites work: Some simple scheduling algorithms
cites work: A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
cites work: Scheduling jobs with release dates and tails on identical machines to minimize the makespan
cites work: Minimizing makespan on parallel machines subject to release dates and delivery times
cites work: Search tree based approaches for parallel machine scheduling
cites work: Efficient approximation schemes for scheduling problems with release dates and delivery times
cites work: Q4217266
cites work: Q3525910
DOI: 10.1007/S40305-019-00268-7
Recommended article: Scheduling with job release dates, delivery times and preemption penalties
Recommended article: On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals
Recommended article: Job release scheduling problem: complexity and an approximation algorithm
Recommended article: Efficient approximation schemes for scheduling problems with release dates and delivery times
Recommended article: Scheduling with families of jobs and delivery coordination under job availability
Recommended article: Parallel machine scheduling with nested processing set restrictions and job delivery times
Recommended article: Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times
Recommended article: Q3404884
Recommended article: Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
Recommended article: Job shop scheduling with unit time operations under resource constraints and release dates
description: scientific article; zbMATH DE number 7361009