Minimization of the maximal lateness for a single machine
- 57 Downloads
Consideration was given to the classical NP-hard problem 1|r j |L max of the scheduling theory. An algorithm to determine the optimal schedule of processing n jobs where the job parameters satisfy a system of linear constraints was presented. The polynomially solvable area of the problem 1|r j |L max was expanded. An algorithm was described to construct a Pareto-optimal set of schedules by the criteria L max and C max for complexity of O(n 3logn) operations.
KeywordsRemote Control Optimal Schedule Single Machine Partial Schedule Schedule Theory
Unable to display preview. Download preview PDF.
- 3.Jackson, J.R., Scheduling a Production Line to Minimize Maximum Tardiness, Manag. Sci. Res. Project. Res. Report no. 43, Los Angeles: Univ. of California, 1955.Google Scholar
- 4.Simons, B.B., A Fast Algorithm for Single Processor Scheduling, in 19 Ann. Sympos. Found. Comp. Sci., Ann Arbor, 1978, pp. 246–252.Google Scholar
- 6.Lazarev, A.A., Teoriya raspisanii. Otsenka absolyutnoi pogreshnosti i skhema priblizhennogo resheniya zadach teorii raspisanii (Scheduling Theory. Estimation of the Absolute Error and a Scheme of Approximate Solution of the Problems of Scheduling Theory), Moscow: MFTI, 2008.Google Scholar
- 7.Lazarev, A.A., Arkhipov, D.I., and Karpov, I.V., Polynomially Solvable Case of the NP-hard Problem 1|r j|L max, in Int. Conf. Project Management Sched., Tours, 2010, pp. 289–293.Google Scholar