Scheduling jobs with release and delivery times subject to nested eligibility constraints
From MaRDI portal
(Redirected from Publication:2033983)
Recommendations
- Scheduling with job release dates, delivery times and preemption penalties
- On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals
- Job release scheduling problem: complexity and an approximation algorithm
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- Scheduling with families of jobs and delivery coordination under job availability
- Parallel machine scheduling with nested processing set restrictions and job delivery times
- Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times
- Scheduling with rejection subject to release times and precedence constraints
- Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
- Job shop scheduling with unit time operations under resource constraints and release dates
Cites work
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 5764783 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 1302193 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Approximation algorithms for scheduling unrelated parallel machines
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- Fast approximation algorithms for job scheduling with processing set restrictions
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- Minimizing makespan on parallel machines subject to release dates and delivery times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling under a grade of service provision
- Parallel machine scheduling with job assignment restrictions
- Parallel machine scheduling with nested job assignment restrictions
- Parallel machine scheduling with nested processing set restrictions
- Parallel machine scheduling with nested processing set restrictions and job delivery times
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- Scheduling parallel machines with inclusive processing set restrictions
- Scheduling parallel machines with inclusive processing set restrictions and job release times
- Scheduling unit length jobs with parallel nested machine processing set restrictions
- Search tree based approaches for parallel machine scheduling
- Some simple scheduling algorithms
- Task Scheduling on a Multiprocessor System with Independent Memories
Cited in
(3)
This page was built for publication: Scheduling jobs with release and delivery times subject to nested eligibility constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2033983)
