zbMATH — the first resource for mathematics

Characterizing the set of feasible sequences for n jobs to be carried out on a single machine. (English) Zbl 0425.90053

90B35 Deterministic scheduling theory in operations research
Full Text: DOI
[1] Conway, R.W.; Maxwell, W.L.; Miller, L.W., Theory of scheduling, (1967), Addison-Wesley Reading, MA · Zbl 1058.90500
[2] Day, J.E.; Hottenstein, M.P., Review of sequencing research, Naval res. logist. quart., 17, 11-39, (1970) · Zbl 0202.18501
[3] Elmaghraby, S.E., The machine sequencing problem. review and extensions, Naval res. logist. quart., 15, 206-232, (1968)
[4] Erschler, J.; Roubellat, F.; Vernhes, J.P., A decision making process for the real time control of a production unit, () · Zbl 0335.90027
[5] Holloway, C.A.; Nelson, R.T., Alternative formulation of the job shop problem with due dates, Management sci., 20, 65-75, (1973) · Zbl 0304.90057
[6] Panwalkar, S.S.; Dudek, R.A.; Smith, M.L., Sequencing research and the industrial scheduling problem, () · Zbl 0269.90025
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.