×

zbMATH — the first resource for mathematics

Two scheduling problems with fuzzy due-dates. (English) Zbl 0767.90037
Summary: Up to now, almost all papers on scheduling problems assume that due-dates are fixed and none treats fuzzy due-dates as far as we know. But in some situations due-dates are not rigid and some violations may be accepted. Considering these cases, this paper investigates scheduling problems with fuzzy due-dates, that is, a generalized two machine open shop scheduling problem with fuzzy due-dates and an identical machine scheduling problem with fuzzy due-dates.

MSC:
90B35 Deterministic scheduling theory in operations research
90C70 Fuzzy and other nonstochastic uncertainty mathematical programming
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Dinic, E.A., Algorithm for solution of a problem of maximum flow in a network with power estimation, Soviet math. dokl., 11, 1277-1280, (1970) · Zbl 0219.90046
[2] Gonzalez, T.; Sahni, S., Open shop scheduling to minimize finish time, J. ACM, 23, 665-679, (1976) · Zbl 0343.68031
[3] Lawler, E.L.; Lenstra, J.K.; Rinooy Kan, A.H.G., Minimizing maximum lateness in a two machine open shop, Math. oper. res., 6, 153-158, (1981) · Zbl 0496.90047
[4] Masuda, T.; Ishii, H.; Nishida, T., Two machine scheduling problem for jobs with generalized duedates, Math. japonica, 30, 117-125, (1985) · Zbl 0572.90053
[5] Megiddo, N., Combinatorial optimization with rational objective functions, Math. oper. res., 4, 414-424, (1979) · Zbl 0425.90076
[6] Megiddo, N., Linear time algorithm for linear programming in srr^3 and related problems, SIAM J. comput., 12, 759-776, (1983) · Zbl 0521.68034
[7] Zimmermann, H.-J., Fuzzy set theory and its application, (1985), Kluwer-Nijhoff Dordrecht
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.