Abstract
The single machine group scheduling problem is considered. Jobs are classified into several groups on the basis of group technology, i.e. jobs of the same group have to be processed jointly. A machine set-up time independent of the group sequence is needed between each two consecutive groups. A schedule specifies the sequence of groups and the sequence of jobs in each group. The quality of a schedule is measured by the criteriaF 1, ...,F m ordered by their relative importance. The objective is to minimize the least important criterionF m subject to the schedule being optimal with respect to the more important criterionF m−1 which is minimized on the set of schedules minimizing criterionF m−2 and so on. The most important criterion isF 1, which is minimized on the set of all feasible schedules. An approach to solve this multicriterion problem in polynomial time is presented if functionsF 1, ...,F m have special properties. The total weighted completion time and the total weighted exponential time are the examples of functionsF 1, ...,F m−1 and the maximum cost is an example of functionF m for which our approach can be applied.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K.R. Baker, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints, Oper. Res. 31(1983)381–386.
K.R. Baker, Scheduling groups of jobs in the two-machine flow shop, Math. Comp. Mod. 13(1990)29–36.
R.W. Conway, W.L. Maxwell and L.W. Miller,Theory of Scheduling (Addison-Wesley, Reading, MA, 1967).
R.L. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: A survey, Ann. Discr. Math. 5(1979)287–326.
I. Ham, K. Hitomi and T. Yoshida,Group Technology (Kluwer-Nijkoff, Dordrecht, 1985).
M.Y. Kovalyov and A.V. Tuzikov, Minimizing maximum penalty on a single machine under group technology and precedence constraints, Preprint N 35, Institute of Engineering Cybernetics, Belarus Academy of Sciences, Minsk (1991).
E.L. Lawler, Optimal sequencing of a single machine subject to precedence constraints, Manag. Sci. 19(1973)544–546.
S.P. Mitrofanov,Scientific Principles of Group Technology, transl. by E. Harris, National Lending Library, Yorkshire (1966).
N. Nakamura, T. Yoshida and K. Hitomi, Group production scheduling for minimum total tardiness. Part (I), AIIE Trans. 10(1978)157–162.
M. Ozden, P. Egbelu and A. Iyer, Job scheduling in a group technology environment for a single facility, Comp. Eng. 9(1985)67–72.
C.N. Potts and L.N. Van Wassenhove, Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity, J. Oper. Res. Soc. 43(1991)395–406.
W.E. Smith, Various optimizers for single-stage production, Naval Res. Logist. Quart. 3(1956)59–66.
T. Yoshida and K. Hitomi, Optimal two-stage production scheduling with setup times separated, AIIE Trans. 11(1978)261–262.
T. Yoshida, N. Nakamura and K. Hitomi, A study of production scheduling (optimization of group scheduling on a single production stage), Trans. Japan Soc. Mech. Eng. 39(1973)1993–2003.
Author information
Authors and Affiliations
Additional information
The research of the authors was partially supported by a KBN Grant No. 3 P 406 003 05, the Fundamental Research Fund of Belarus, Project N Φ60-242, and the Deutsche Forschungsgemeinschaft, Project Schema, respectively. The paper was completed while the first author was visiting the University of Melbourne.
Rights and permissions
About this article
Cite this article
Janiak, A., Kovalyov, M.Y. Single machine group scheduling with ordered criteria. Ann Oper Res 57, 191–201 (1995). https://doi.org/10.1007/BF02099697
Issue Date:
DOI: https://doi.org/10.1007/BF02099697