Single machine scheduling with controllable release and processing parameters

Authors:
Natalia V. Shakhlevich;Vitaly A. Strusevich
Affiliations:
School of Computing, University of Leeds, Leeds, UK;School of Computing and Mathematical Sciences, University of Greenwich, Old Royal Naval College, London, UK
Venue:
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Year:
2006

Citing 7
Cited 12

Two machine mixed shop scheduling problem with controllable machine speeds

Discrete Applied Mathematics - Discrete applied mathematics in Japan
A survey of results for sequencing problems with controllable processing times

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
Two machine flow shop scheduling problem with no wait in process: controllable machine speeds

Discrete Applied Mathematics
Minimization of Half-Products

Mathematics of Operations Research
Supply chain scheduling: Batching and delivery

Operations Research
Supply chain scheduling: sequence coordination

Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02

A survey of scheduling with controllable processing times

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

Journal of Scheduling
Note: FPTAS for half-products minimization with scheduling applications

Discrete Applied Mathematics
Power-aware scheduling for makespan and flow

Journal of Scheduling
Optimal due date assignment and resource allocation in a group technology scheduling environment

Computers and Operations Research
Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling

Discrete Applied Mathematics
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates

Journal of Scheduling
Scheduling a batching machine with convex resource consumption functions

Information Processing Letters
Scheduling with due date assignment under special conditions on job processing

Journal of Scheduling
Theoretical Analysis on Powers-of-Two Applied to JSP: A Case Study of Turbine Manufacturing

International Journal of Green Computing
Scheduling with compressible and stochastic release dates

Computers and Operations Research
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.00

Visualization

Abstract

This paper considers single machine scheduling problems in which the job processing times and/or their release dates are controllable. Possible changes to the controllable parameters are either individual or done by controlling the relevant processing or release rate. The objective is to minimize the sum of the makespan plus the cost for changing the parameters. For the problems of this type, we provide a number of polynomial-time algorithms and give a fairly complete complexity classification.