Isomorphic scheduling problems
From MaRDI portal
Publication:744639
DOI10.1007/S10479-012-1222-2zbMATH Open1296.90045OpenAlexW2076633866MaRDI QIDQ744639FDOQ744639
Authors: D. Kharzeev 
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
Recommendations
- Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
- Isomorphism for digraphs and sequences of shop scheduling problems
- Equivalent time-dependent scheduling problems
- scientific article; zbMATH DE number 4164535
- Structured solutions in scheduling problems
- scientific article; zbMATH DE number 4031379
- On approximating a scheduling problem
- scientific article; zbMATH DE number 1560337
- scientific article; zbMATH DE number 1760037
- Scheduling and fixed-parameter tractability
approximation algorithmsschedulingsingle machineparallel machinesdeteriorating jobspolynomial algorithmsdedicated machines
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Optimal two- and three-stage production schedules with set-up time included
- Algorithms for Scheduling Independent Tasks
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- A single-machine scheduling problem with two-agent and deteriorating jobs
- Two-Machine Super-Shop Scheduling Problem
- Open Shop Scheduling to Minimize Finish Time
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Time-dependent scheduling
- Single machine scheduling with deadlines and increasing rates of processing times
- The complexity of scheduling starting time dependent tasks with release times
- Scheduling time-dependent jobs under mixed deterioration
- Planning and Scheduling in Manufacturing and Services
- Current trends in deterministic scheduling
- Equivalent time-dependent scheduling problems
- A concise survey of scheduling with time-dependent processing times
- Scheduling with time dependent processing times: Review and extensions
- A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration
- Single-machine scheduling with both deterioration and learning effects
- Complexity and approximability of scheduling resumable proportionally deteriorating jobs
- Structural properties of optimal schedules with preemption
- Complexity analysis of job-shop scheduling with deteriorating jobs
- Title not available (Why is that?)
- Conjugate problems in time-dependent scheduling
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel Processing and Applied Mathematics
Cited In (11)
- Minmax common due-window assignment scheduling with deteriorating jobs
- Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization
- Coke production scheduling problem: a parallel machine scheduling with batch preprocessings and location-dependent processing times
- Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs
- Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
- Complexity of scheduling with proportional deterioration and release dates
- Conjugate problems in time-dependent scheduling
- Precedence constrained parallel-machine scheduling of position-dependent jobs
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Equivalent time-dependent scheduling problems
- Coordination mechanisms for scheduling games with proportional deterioration
This page was built for publication: Isomorphic scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744639)
