Scheduling jobs with a V-shaped time-dependent processing time

In the field of time-dependent scheduling, a job’s processing time is specified by a function of its start time. While monotonic processing time functions are well-known in the literature, this paper introduces non-monotonic functions with a convex, piecewise-linear V-shape similar to the absolute v...

Full description

Saved in:
Bibliographic Details
Published in:Journal of scheduling Vol. 23; no. 6; pp. 751 - 768
Main Author: Sedding, Helmut A.
Format: Journal Article
Language:English
Published: New York Springer US 01.12.2020
Springer Nature B.V
Subjects:
Artificial Intelligence
Assembly lines
Business and Management
Calculus of Variations and Optimal Control; Optimization
Job shops
Operations Research/Decision Theory
Optimization
Polynomials
Production planning
Scheduling
Shape
Slopes
Supply Chain Management
Time dependence
Time functions
Single-machine scheduling
V-shaped processing time
Non-monotonic processing time
Piecewise-linear processing time
Time-dependent scheduling
ISSN:1094-6136, 1099-1425
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the field of time-dependent scheduling, a job’s processing time is specified by a function of its start time. While monotonic processing time functions are well-known in the literature, this paper introduces non-monotonic functions with a convex, piecewise-linear V-shape similar to the absolute value function. They are minimum at an ideal start time, which is the same for all given jobs. Then, the processing time equals the job’s basic processing time. Earlier or later, it increases linearly with slopes that can be asymmetric and job-specific. The objective is to sequence the given jobs on a single machine and minimize the makespan. This is motivated by production planning of moving car assembly lines, in particular, to sequence a worker’s assembly operations such that the time-dependent walking times to gather materials from the line-side is minimized. This paper characterizes the problem’s computational complexity in several angles. NP-hardness is observed even if the two slopes are the same for all jobs. A fully polynomial time approximation scheme is devised for the more generic case of agreeable ratios of basic processing time and slopes. In the most generic case with job-specific slopes, several polynomial cases are identified.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1094-6136
1099-1425
DOI:10.1007/s10951-020-00665-4