Isomorphic scheduling problems
From MaRDI portal
Publication:744639
DOI10.1007/s10479-012-1222-2zbMath1296.90045OpenAlexW2076633866MaRDI QIDQ744639
Publication date: 26 September 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1222-2
schedulingparallel machinesdeteriorating jobssingle machinepolynomial algorithmsapproximation algorithmsdedicated machines
Related Items (8)
Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs ⋮ Precedence constrained parallel-machine scheduling of position-dependent jobs ⋮ Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices ⋮ Coordination mechanisms for scheduling games with proportional deterioration ⋮ Coke production scheduling problem: a parallel machine scheduling with batch preprocessings and location-dependent processing times ⋮ Complexity of scheduling with proportional deterioration and release dates ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of scheduling starting time dependent tasks with release times
- A single-machine scheduling problem with two-agent and deteriorating jobs
- Time-dependent scheduling
- Scheduling time-dependent jobs under mixed deterioration
- A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration
- Conjugate problems in time-dependent scheduling
- Equivalent time-dependent scheduling problems
- Complexity analysis of job-shop scheduling with deteriorating jobs
- Current trends in deterministic scheduling
- A concise survey of scheduling with time-dependent processing times
- Single machine scheduling with deadlines and increasing rates of processing times
- Single-machine scheduling with both deterioration and learning effects
- Complexity and approximability of scheduling resumable proportionally deteriorating jobs
- Optimal two- and three-stage production schedules with setup times included
- Scheduling with time dependent processing times: Review and extensions
- Two-Machine Super-Shop Scheduling Problem
- Algorithms for Scheduling Independent Tasks
- Open Shop Scheduling to Minimize Finish Time
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Planning and Scheduling in Manufacturing and Services
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Bounds for Certain Multiprocessing Anomalies
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Bounds on Multiprocessing Timing Anomalies
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Parallel Processing and Applied Mathematics
This page was built for publication: Isomorphic scheduling problems
