A survey of scheduling with controllable processing times

Authors:
Dvir Shabtay;George Steiner
Affiliations:
Management Science and Information Systems Area, Michael G. DeGroote School of Business, McMaster University, Hamilton, Ont., Canada;Management Science and Information Systems Area, Michael G. DeGroote School of Business, McMaster University, Hamilton, Ont., Canada
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 34
Cited 37

Time-optimal control in a single machine problem with resource constraints

Automatica (Journal of IFAC)
Minimization of resource consumption under a given deadline in the two-processor flow-shop scheduling problem

Information Processing Letters
A survey of results for sequencing problems with controllable processing times

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Convex resource allocation problems on directed acyclic graphs: duality, complexity, special cases, and extensions

Mathematics of Operations Research
Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
Scheduling independent one—processor tasks with linear models of release dates under a given maximum schedule length to minimize resource consumption

Systems Analysis Modelling Simulation
Batch sizing and job sequencing on a single machine

Annals of Operations Research
Jackson's rule for single-machine scheduling: making a good heuristic better

Mathematics of Operations Research
An approximation algorithm for the generalized assignment problem

Mathematical Programming: Series A and B
About strongly polynomial time algorithms for quadratic optimization over submodular constraints

Mathematical Programming: Series A and B
A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times

Discrete Applied Mathematics
Minimization of Half-Products

Mathematics of Operations Research
Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
Preemptive Scheduling of Uniform Processor Systems

Journal of the ACM (JACM)
Convex quadratic and semidefinite programming relaxations in scheduling

Journal of the ACM (JACM)
Some comments on sequencing with controllable processing times

Computing
Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard

Information Processing Letters
Bicriterion Single Machine Scheduling with Resource Dependent Processing Times

SIAM Journal on Optimization
Heuristics for hybrid flow shops with controllable processing times and assignable due dates

Computers and Operations Research
Single machine scheduling with a variable common due date and resource-dependent processing times

Computers and Operations Research
Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine

Computers and Operations Research
Approximation schemes for parallel machine scheduling problems with controllable processing times

Computers and Operations Research
Minimizing the total weighted flow time in a single machine with controllable processing times

Computers and Operations Research
Notes on max flow time minimization with controllable processing times

Computing
Minimizing Completion Time Variance with Compressible Processing Times

Journal of Global Optimization
A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates

Computers and Operations Research
Single machine scheduling with controllable release and processing parameters

Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Single machine batch scheduling to minimize total completion time and resource consumption costs

Journal of Scheduling
Single-machine scheduling with trade-off between number of tardy jobs and compression cost

Journal of Scheduling
Job-shop scheduling with convex models of operations

Mathematical and Computer Modelling: An International Journal
Completion time variance minimization on a single machine is difficult

Operations Research Letters
Single machine batch scheduling with deadlines and resource dependent processing times

Operations Research Letters
Single machine scheduling with discretely controllable processing times

Operations Research Letters
A 32-approximation algorithm for parallel machine scheduling with controllable processing times

Operations Research Letters

A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine

Journal of Scheduling
Minimizing total tardiness on a single machine with controllable processing times

Computers and Operations Research
Tabu-search for single machine scheduling with controllable processing times

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Scheduling identical parallel machines and operators within a period based changing mode

Computers and Operations Research
Bicriteria robotic operation allocation in a flexible manufacturing cell

Computers and Operations Research
Power-aware scheduling for makespan and flow

Journal of Scheduling
An anticipative scheduling approach with controllable processing times

Computers and Operations Research
Parallel machine match-up scheduling with manufacturing cost considerations

Journal of Scheduling
A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates

Computers and Operations Research
Optimal due date assignment and resource allocation in a group technology scheduling environment

Computers and Operations Research
Exact and heuristic algorithms for parallel-machine scheduling with DeJong's learning effect

Computers and Industrial Engineering
Single-machine scheduling with learning effect and resource-dependent processing times

Computers and Industrial Engineering
Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness

Computers and Operations Research
A note on makespan minimization in proportionate flow shops

Information Processing Letters
Single-machine group scheduling with resource allocation and learning effect

Computers and Industrial Engineering
Machine scheduling in custom furniture industry through neuro-evolutionary hybridization

Applied Soft Computing
Two due date assignment problems with position-dependent processing time on a single-machine

Computers and Industrial Engineering
Decision Support and Optimization in Shutdown and Turnaround Scheduling

INFORMS Journal on Computing
Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling

Discrete Applied Mathematics
Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time

Computers and Operations Research
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates

Journal of Scheduling
Parallel machine scheduling problem to minimize the makespan with resource dependent processing times

Applied Soft Computing
An analysis of cyclic scheduling problems in robot centered cells

Computers and Operations Research
Single machine scheduling with precedence constraints and positionally dependent processing times

Computers and Operations Research
Minimizing makespan in an ordered flow shop with machine-dependent processing times

Journal of Combinatorial Optimization
Complexity of a scheduling problem with controllable processing times

Operations Research Letters
A strong conic quadratic reformulation for machine-job assignment with controllable processing times

Operations Research Letters
Scheduling a batching machine with convex resource consumption functions

Information Processing Letters
Scheduling jobs with time-resource tradeoff via nonlinear programming

Discrete Optimization
Scheduling with due date assignment under special conditions on job processing

Journal of Scheduling
Two-machine flowshop scheduling with flexible operations and controllable processing times

Computers and Operations Research
Decision Support and Optimization in Shutdown and Turnaround Scheduling

INFORMS Journal on Computing
Noncooperative Games for Subcontracting Operations

Manufacturing & Service Operations Management
A survey on offline scheduling with rejection

Journal of Scheduling
Single machine scheduling with controllable processing times to minimize total tardiness and earliness

Computers and Industrial Engineering
Single-machine batch delivery scheduling with an assignable common due date and controllable processing times

Computers and Industrial Engineering
Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity

Computers and Industrial Engineering

Quantified Score

Hi-index	0.04

Visualization

Abstract

In classical deterministic scheduling problems, the job processing times are assumed to be constant parameters. In many practical cases, however, processing times are controllable by allocating a resource (that may be continuous or discrete) to the job operations. In such cases, each processing time is a decision variable to be determined by the scheduler, who can take advantage of this flexibility to improve system performance. Since scheduling problems with controllable processing times are very interesting both from the practical and theoretical point of view, they have received a lot of attention from researchers over the last 25 years. This paper aims to give a unified framework for scheduling with controllable processing times by providing an up-to-date survey of the results in the field.