SCHEDULING, LINEAR systems, MONOTONIC functions, POLYNOMIALS, ALGORITHMS, PROBLEM solving
Abstract
This paper considers the single machine scheduling problem with a new version of time-dependent processing times. The processing time of a job is defined as a piecewise linear function of its start time. It is preferred that the processing of each job be started at a specific time which means that processing the job before or after that time implies additional effort to accomplish the job. The job-processing time is a nonmonotonic function of its start time. The increasing rate of processing times is job independent and the objective is to minimize the cycle time. We show that the optimal schedule is V shaped and propose an optimal polynomial time algorithm for the problem. [ABSTRACT FROM AUTHOR]
PRODUCTION scheduling, RESOURCE allocation, POLYNOMIALS, ALGORITHMS, MATHEMATICAL models, NUMERICAL analysis, PROBLEM solving
Abstract
In this paper, we focus on real-life settings that require the development of new models of flowshop scheduling problems, where job processing times can increase with the number of processed jobs due to the aging effect and decrease by the allocation of additional resource. We analyse the makespan minimization flowshop problem with such model and also with the aging effect only. We prove that the considered problems and their special cases are still polynomially solvable under given conditions, and on their basis, we provide optimal polynomial time solution algorithms. [ABSTRACT FROM AUTHOR]