Job Sequencing with Exponential Functions of Processing Times

Authors:
Adam Janiak;Mikhail Y. Kovalyov
Affiliations:
Institute of Computer Engineering, Control and Robotics, Wroclaw University of Technology, Janiszewskiego 11/17, 50-372 Wroclaw, Poland, e-mail: adam.janiak@pwr.wroc.pl;Faculty of Economics, Belarus State University, and United Institute of Informatics Problems, National Academy of Sciences of Belarus, Skorini 4, 220050 Minsk, Belarus, e-mail: kovalyovmy@bsu.by
Venue:
Informatica
Year:
2006

Citing 4
Cited 6

Scheduling deteriorating jobs on a single processor

Operations Research
Complexity of scheduling tasks with time-dependent execution times

Information Processing Letters
Scheduling jobs under simple linear deterioration

Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

A two-machine flowshop makespan scheduling problem with deteriorating jobs

Computers and Industrial Engineering
Continuous Nonlinear Programming Techniques to Solve Scheduling Problems

Informatica
A generic approach to proving NP-hardness of partition type problems

Discrete Applied Mathematics
Proportionate flowshops with general position-dependent processing times

Information Processing Letters
A branch and bound algorithm for single machine scheduling with deteriorating values of jobs

Mathematical and Computer Modelling: An International Journal
Scheduling with a position-weighted learning effect based on sum-of-logarithm-processing-times and job position

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardness of the makespan minimization problem with arbitrary job release times. For decreasing functions, maximum lateness minimization problem is proved to be strongly NP-hard and total weighted completion time minimization problem is proved to be ordinary NP-hard. Heuristic algorithms are presented and computationally tested for these problems.