A review of four decades of time-dependent scheduling: main results, new topics, and open problems
From MaRDI portal
Publication:2305016
DOI10.1007/s10951-019-00630-wzbMath1434.90057OpenAlexW3003314034MaRDI QIDQ2305016
Publication date: 10 March 2020
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-019-00630-w
algorithmscomputational complexityschedulingparallel machinesdeteriorating jobssingle machineapproximation schemesdedicated machinesshortening jobsalterable jobs
Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Scheduling with deterioration effects and maintenance activities under parallel processors, Literature reviews in operations research: a new taxonomy and a meta review, Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs, Optimization of scheduling problems with deterioration effects and an optional maintenance activity, A Production Plan Considering Parallel Machines and Deteriorating Effects: Minimizing the Makespan in the Section of Steel Box Girder Processing, Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components, Knapsack problems with position-dependent item weights or profits, A best possible algorithm for an online scheduling problem with deteriorating effect in steel box girder section production, New results for an open time-dependent scheduling problem, Scheduling jobs with a V-shaped time-dependent processing time, Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events, Single-machine scheduling problems with the general sum-of-processing-time and position-dependent effect function, A unified analysis for scheduling problems with variable processing times
Cites Work
- Scheduling linear deteriorating jobs with an availability constraint on a single machine
- Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs
- Single-machine scheduling problems with start-time dependent processing time
- Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
- Scheduling with step-improving processing times
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Non-cooperative games
- Optimal two- and three-stage production schedules with setup times included
- Online Makespan Scheduling of Linear Deteriorating Jobs on Parallel Machines
- Approximation Scheme for Scheduling Resumable Proportionally Deteriorating Jobs
- SCHEDULING PROPORTIONALLY DETERIORATING JOBS IN TWO-MACHINE OPEN SHOP WITH A NON-BOTTLENECK MACHINE
- Scheduling with time dependent processing times: Review and extensions
- A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
- Planning and Scheduling in Manufacturing and Services
- Minimizing Total Tardiness on One Machine is NP-Hard
- Scheduling on semi-identical processors
- Fifty years of scheduling: a survey of milestones
- Scheduling Deteriorating Jobs on a Single Processor
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
- Parallel machine scheduling problems with proportionally deteriorating jobs
- Scheduling Problems with Two Competing Agents
- Sequencing with Series-Parallel Precedence Constraints
- Parametric problem in scheduling theory
- The Recognition of Series Parallel Digraphs
- Scheduling the Open Shop to Minimize Mean Flow Time
- A Remark on Search and Sequencing Problems
- A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
- V-Shaped Policies for Scheduling Deteriorating Jobs
- Job Shop Scheduling with Due Dates and Variable Processing Times
- Open Shop Scheduling to Minimize Finish Time
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling deteriorating jobs to minimize makespan
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- NP-hard cases in scheduling deteriorating jobs on dedicated machines
- Single-machine scheduling with deteriorating jobs
- Reducibility among Combinatorial Problems
- Heuristics for Parallel Machine Scheduling with Deterioration Effect
- Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs
- Parallel Processing and Applied Mathematics
- Multiagent Scheduling
- An approximation algorithm for parallel machine scheduling with simple linear deterioration
- A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs
- Branch-and-Bound Methods: A Survey
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Technical Note—Minimizing a Function of Permutations of n Integers
- Branch-and-Bound Methods: General Formulation and Properties
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Partial dominated schedules and minimizing the total completion time of deteriorating jobs
- Handbook on Scheduling
- Multi-Machine Scheduling With Linear Deterioration
- Algorithms and Computation
- Parallel Processing and Applied Mathematics
- Scheduling
- A note on unrelated parallel machine scheduling with time-dependent processing times
- The NP-completeness column: An ongoing guide
- Combinatorial optimization. Theory and algorithms
- Minimizing maximum lateness under linear deterioration
- A time-dependent multiple criteria single-machine scheduling problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling chains to minimize mean flow time
- The complexity of scheduling starting time dependent tasks with release times
- An alternative approach for proving the NP-hardness of optimization problems
- Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria
- Minimizing makespan in three-machine flow shops with deteriorating jobs
- Patient scheduling with periodic deteriorating maintenance on single medical device
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
- A survey on offline scheduling with rejection
- An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
- Optimal algorithms for online single machine scheduling with deteriorating jobs
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Uniform parallel-machine scheduling with time dependent processing times
- Scheduling a variable maintenance and linear deteriorating jobs on a single machine
- Worst-case equilibria
- Scheduling with time-changing effects and rate-modifying activities
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- Scheduling linearly shortening jobs under precedence constraints
- Two-agent single-machine scheduling problems under increasing linear deterioration
- A single-machine scheduling problem with two-agent and deteriorating jobs
- Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
- A note on the complexity of flow-shop scheduling with deteriorating jobs
- Some single-machine scheduling problems with general effects of learning and deterioration
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
- Scheduling jobs with varying processing times
- Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
- Single-machine scheduling with nonlinear deterioration
- Parallel-machine scheduling with deteriorating jobs and rejection
- Optimal composition ordering problems for piecewise linear functions
- Single machine group scheduling with time dependent processing times and ready times
- Isomorphic scheduling problems
- Models and algorithms of time-dependent scheduling
- Batch scheduling of step deteriorating jobs
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
- Parallel-machine scheduling of simple linear deteriorating jobs
- An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
- Scheduling deteriorating jobs subject to job or machine availability constraints
- Patients scheduling problems with deferred deteriorated functions
- An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs
- Time-dependent scheduling
- Scheduling linear deteriorating jobs with rejection on a single machine
- Scheduling time-dependent jobs under mixed deterioration
- The Browne-Yechiali single-machine sequence is optimal for flow-shops
- Single machine scheduling with decreasing linear deterioration under precedence constraints
- ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
- A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times
- Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
- The single-machine total tardiness scheduling problem: review and extensions
- Conjugate problems in time-dependent scheduling
- Scheduling jobs under decreasing linear deterioration
- Equivalent time-dependent scheduling problems
- A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem
- Online algorithms. The state of the art
- On a scheduling problem of time deteriorating jobs
- The time dependent machine makespan problem is strongly NP-complete
- Scheduling jobs under simple linear deterioration
- Complexity of scheduling tasks with time-dependent execution times
- Single machine scheduling with start time dependent processing times: Some solvable cases
- Flowshop scheduling with dominant machines
- Complexity analysis of job-shop scheduling with deteriorating jobs
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- An open shop scheduling problem with a non-bottleneck machine
- Efficient algorithms for a scheduling problem and its applications to illicit drug market crackdowns
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
- A concise survey of scheduling with time-dependent processing times
- Single machine scheduling with deadlines and increasing rates of processing times
- Machine scheduling with a rate-modifying activity
- Minimizing the total weighted completion time of deteriorating jobs
- Coordination mechanisms for scheduling games with proportional deterioration
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
- Scheduling with time-dependent discrepancy times
- Identical parallel machine scheduling with time-dependent processing times
- Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- Complexity of scheduling with proportional deterioration and release dates
- Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
- A note on single-processor scheduling with time-dependent execution times
- Parallel machine scheduling with time dependent processing times
- Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs
- Scheduling with batching: A review
- Scheduling with limited machine availability
- An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- Parallel machines scheduling with deteriorating jobs and availability constraints
- Single-machine scheduling problems with precedence constraints and simple linear deterioration
- Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval
- Approximation schemes for scheduling a maintenance and linear deteriorating jobs
- Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
- Complexity and approximability of scheduling resumable proportionally deteriorating jobs
- A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
- A survey of scheduling with controllable processing times
- Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs
- Two-agent scheduling of time-dependent jobs
- Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences
- Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints
- Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times
- A multiple-criterion model for machine scheduling
- Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
- Parallel-machine scheduling with simple linear deterioration to minimize total completion time
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- Parallel-machine scheduling with time dependent processing times
