A concise survey of scheduling with time-dependent processing times

DOI10.1016/S0377-2217(02)00909-8MaRDI QIDQ1410319zbMATH OpenOpenAlexFDO

Authors T. C. Edwin Cheng, Q. Ding, B. M. T. Lin

Publication date 14 October 2003

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0377-2217(02)00909-8

zbMATH Keywords

Computational complexitySchedulingSurveySequencingTime dependence

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Scheduling with time dependent processing times: Review and extensions
• A survey of scheduling with controllable processing times
• Single-machine scheduling with time window-dependent processing times
• scientific article; zbMATH DE number 5031195
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems

Cites work

• scientific article; zbMATH DE number 5345853 (Why is no real title available?)
• scientific article; zbMATH DE number 3906216 (Why is no real title available?)
• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 724323 (Why is no real title available?)
• scientific article; zbMATH DE number 2086777 (Why is no real title available?)
• A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
• A note on scheduling on a single processor with speed dependent on a number of executed jobs
• A note on single-processor scheduling with time-dependent execution times
• A variant of the permutation flow shop model with variable processing times
• Complexity analysis of job-shop scheduling with deteriorating jobs
• Complexity of scheduling tasks with time-dependent execution times
• Hierarchical Control Of The Two Processor Flow-Shop With State Dependent Processing Times: Complexity Analysis And Approximate Algorithms
• Makespan minimization in single-machine scheduling with step-deterioration of processing times
• Minimizing maximum lateness under linear deterioration
• Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
• Minimizing the total weighted completion time of deteriorating jobs
• Multi-Machine Scheduling With Linear Deterioration
• NP-hard cases in scheduling deteriorating jobs on dedicated machines
• On a scheduling problem of time deteriorating jobs
• On general routing problems
• Optimal control of a class of DEDS: Flow-shops with state-dependent processing times
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel machine scheduling with time dependent processing times
• Scheduling Deteriorating Jobs on a Single Processor
• Scheduling deteriorating jobs to minimize makespan
• Scheduling jobs under simple linear deterioration
• Scheduling jobs with piecewise linear decreasing processing times
• Scheduling jobs with varying processing times
• Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time
• Scheduling problems with a learning effect
• Scheduling start time dependent jobs to minimize the total weighted completion time
• Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
• Scheduling with time dependent processing times: Review and extensions
• Scheduling with time-dependent execution times
• Single machine scheduling subject to deadlines and resource dependent processing times
• Single machine scheduling with deadlines and increasing rates of processing times
• Single machine scheduling with learning effect considerations
• Single machine scheduling with nonlinear cost functions
• Single machine scheduling with start time dependent processing times: Some solvable cases
• Single machine scheduling with step-deteriorating processing times
• Single-machine scheduling with learning considerations
• The NP-completeness column: An ongoing guide
• The complexity of scheduling starting time dependent tasks with release times
• The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
• The time dependent machine makespan problem is strongly NP-complete
• The two-machine permutation flow shop with state-dependent processing times
• V-Shaped Policies for Scheduling Deteriorating Jobs
• Λ-Shaped Policies to Schedule Deteriorating Jobs

Cited in

(only showing first 100 items - show all)

• Approximation algorithms for parallel machine scheduling with linear deterioration
• A survey of scheduling problems with no-wait in process
• Scheduling flexible maintenance activities subject to job-dependent machine deterioration
• Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
• A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs
• Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time
• Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent
• Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
• Single-machine scheduling with time window-dependent processing times
• A branch and bound algorithm for agile earth observation satellite scheduling
• Single-machine scheduling problems with an actual time-dependent deterioration
• A Two-Stage Flexible Flowshop Problem with Deterioration
• Parallel-batch scheduling with two models of deterioration to minimize the makespan
• Batch scheduling of step deteriorating jobs
• Connected searching of weighted trees
• An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
• Single-machine group scheduling with time-dependent learning effect and position-based setup time learning effect
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
• Single-machine scheduling with time-and-resource-dependent processing times
• Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines
• Robust parallel-batching scheduling with fuzzy deteriorating processing time and variable delivery time in smart manufacturing
• Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times
• Parallel-machine scheduling with simple linear deterioration to minimize total completion time
• Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop
• Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns
• A new approach to the learning effect: Beyond the learning curve restrictions
• Parallel-machine scheduling with time dependent processing times
• Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration
• Flow shop scheduling with effects of learning and deterioration
• Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
• Two-machine flow shop total tardiness scheduling problem with deteriorating jobs
• A unified view of parallel machine scheduling with interdependent processing rates
• Single-machine scheduling problems with machine aging effect and an optional maintenance activity
• Automated sortation conveyors: a survey from an operational research perspective
• Flow shop scheduling problems with decreasing linear deterioration under dominant machines
• Parallel-machine scheduling with deteriorating jobs and rejection
• Some scheduling problems on a single machine with general job effects of position-dependent learning and start-time-dependent deterioration
• Four single-machine scheduling problems involving due date determination decisions
• Scheduling with time-dependent discrepancy times
• The single-machine scheduling problems with deteriorating jobs and learning effect
• A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting
• A single-machine deteriorating job scheduling problem with a non-regular criterion
• Isomorphic scheduling problems
• Parallel-Machine Scheduling with Step-Deteriorating Jobs to Minimize the Total (Weighted) Completion Time
• Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption
• Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
• Scheduling with variable time slot costs
• Scheduling deteriorating jobs subject to job or machine availability constraints
• Scheduling with time dependent processing times: Review and extensions
• Some scheduling problems with past sequence dependent setup times under the effects of nonlinear deterioration and time-dependent learning
• Single machine scheduling with linear deteriorating jobs under predictive disruption
• Scheduling deteriorating jobs with rejection on dominant machines
• Scheduling with position-based deteriorating jobs and multiple deteriorating rate-modifying activities
• The Browne-Yechiali single-machine sequence is optimal for flow-shops
• Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning
• Multi-machine scheduling with deteriorating jobs and scheduled maintenance
• Single-machine scheduling with both deterioration and learning effects
• Single machine slack due window assignment and deteriorating jobs
• Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration
• Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties
• Scheduling linearly shortening jobs under precedence constraints
• Scheduling two-agents with a time-dependent deterioration to minimize the minsum earliness measures
• A single-machine scheduling problem with two-agent and deteriorating jobs
• An optimal single-machine scheduling with linear deterioration rate and rate-modifying activities
• An optimal single-machine scheduling with linear deterioration rate and rate-modifying activities
• Scheduling a single fire fighting resource with deteriorating fire suppression times and set-up times
• Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
• Single-machine group scheduling with general deterioration and learning effects
• Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs
• Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities
• A note on single-machine makespan scheduling with deteriorating jobs and scheduled maintenance
• Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm
• Single machine group scheduling with decreasing time-dependent processing times subject to release dates
• Single-machine scheduling with accelerating deterioration effects
• Single machine group scheduling under decreasing linear deterioration
• Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
• Single-machine scheduling with deteriorating functions for job processing times
• Research on scheduling problems with general effects of deterioration and learning
• Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
• Single machine quadratic penalty function scheduling with deteriorating jobs and group technology
• Two‐machine flowshop scheduling with conditional deteriorating second operations
• Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine
• Some single-machine and flowshop scheduling problems with a non-linear deterioration function
• Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events
• Some single-machine scheduling problems with elapsed-time-based and position-based learning and forgetting effects
• Flow shop scheduling problem with position-dependent processing times
• Single machine group scheduling with time dependent processing times and ready times
• Optimal composition ordering problems for piecewise linear functions
• Single machine scheduling with sum-of-logarithm-processing-times based deterioration
• Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval
• Scheduling deteriorating jobs with a learning effect on unrelated parallel machines
• Parallel-machine scheduling with past-sequence-dependent delivery times and learning effect
• Scheduling jobs with a V-shaped time-dependent processing time
• Some single-machine scheduling with both learning and deterioration effects
• Approximation schemes for scheduling a maintenance and linear deteriorating jobs
• Single-machine makespan minimization scheduling with nonlinear shortening processing times
• Scheduling jobs with position and sum-of-processing-time based processing times
• Time-dependent scheduling
• Two-agent scheduling of time-dependent jobs
• A simple linear time algorithm for scheduling with step-improving processing times

This page was built for publication: A concise survey of scheduling with time-dependent processing times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1410319)