메뉴 건너뛰기




Volumn 169, Issue 3, 2006, Pages 712-722

A new sufficient condition of optimality for the two-machine flowshop problem

Author keywords

Interval structures; Permutation flowshop; Pyramids; Robustness; Scheduling

Indexed keywords

ALGEBRA; OPERATIONS RESEARCH; PROBLEM SOLVING; SCHEDULING; SET THEORY;

EID: 27144474247     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.10.027     Document Type: Article
Times cited : (12)

References (23)
  • 2
    • 0019646082 scopus 로고
    • An interval based representation of temporal knowledge
    • Vancouver, Canada
    • J. Allen, An interval based representation of temporal knowledge, in: Proceedings of the 7th IJCAI, Vancouver, Canada, 1981, pp. 221-226.
    • (1981) Proceedings of the 7th IJCAI , pp. 221-226
    • Allen, J.1
  • 7
    • 85013191950 scopus 로고    scopus 로고
    • Characterization of a set of schedules in a multiple resource context
    • J.-C. Billaut, and F. Roubellat Characterization of a set of schedules in a multiple resource context Journal of Decision Systems 5 1-2 1996 95 109
    • (1996) Journal of Decision Systems , vol.5 , Issue.1-2 , pp. 95-109
    • Billaut, J.-C.1    Roubellat, F.2
  • 8
    • 27144535442 scopus 로고    scopus 로고
    • max scheduling problem
    • Second Conference on Management and Control of Production and Logistics (MCPL'2000), IFAC/IFIP/IEEE, Grenoble
    • max scheduling problem, in: Second Conference on Management and Control of Production and Logistics (MCPL'2000), IFAC/IFIP/IEEE, Grenoble, Proceedings on CD-ROM, 2000.
    • (2000) Proceedings on CD-ROM
    • Benoit, M.1    Billaut, J.-C.2
  • 9
    • 27144520588 scopus 로고    scopus 로고
    • Une approche pour l'ordonnancement robuste de tâches sur une machine
    • Toulouse in French
    • C. Briand, H.T. La, J. Erschler, Une approche pour l'ordonnancement robuste de tâches sur une machine, in: Proceedings MOSIM'03, Toulouse 2003, pp. 205-211 (in French).
    • (2003) Proceedings MOSIM'03 , pp. 205-211
    • Briand, C.1    La, H.T.2    Erschler, J.3
  • 11
    • 0345757591 scopus 로고    scopus 로고
    • Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times
    • J. Cheng, G. Steiner, and P. Stephenson Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times Journal of Scheduling 5 2002 71 92
    • (2002) Journal of Scheduling , vol.5 , pp. 71-92
    • Cheng, J.1    Steiner, G.2    Stephenson, P.3
  • 14
    • 0020597461 scopus 로고
    • A new dominance concept in scheduling n jobs on a single machine with ready times and due dates
    • J. Erschler, G. Fontan, C. Merce, and F. Roubellat A new dominance concept in scheduling n jobs on a single machine with ready times and due dates Operations Research 1 1883 114 127
    • (1883) Operations Research , vol.1 , pp. 114-127
    • Erschler, J.1    Fontan, G.2    Merce, C.3    Roubellat, F.4
  • 16
    • 27144462119 scopus 로고    scopus 로고
    • Trade-off between flexibility and maximum completion time in the two-machine flowshop scheduling problem
    • Paris, France
    • C. Esswein, J.-C. Billaut, Trade-off between flexibility and maximum completion time in the two-machine flowshop scheduling problem, in: International Symposium on Combinatorial Optimisation, 2002, Paris, France.
    • (2002) International Symposium on Combinatorial Optimisation
    • Esswein, C.1    Billaut, J.-C.2
  • 17
    • 13444269168 scopus 로고    scopus 로고
    • Project scheduling under uncertainty-survey and research potentials
    • W. Herroelen, and R. Leus Project scheduling under uncertainty-survey and research potentials European Journal of Operational Research 165 2 2005 289 306
    • (2005) European Journal of Operational Research , vol.165 , Issue.2 , pp. 289-306
    • Herroelen, W.1    Leus, R.2
  • 18
    • 1542502674 scopus 로고    scopus 로고
    • Robust and reactive project scheduling-a review and classification of procedures
    • W. Herroelen, and R. Leus Robust and reactive project scheduling-a review and classification of procedures International Journal of Production Research 42 8 2004 1599 1620
    • (2004) International Journal of Production Research , vol.42 , Issue.8 , pp. 1599-1620
    • Herroelen, W.1    Leus, R.2
  • 19
    • 0003075019 scopus 로고
    • Optimal two and three stage production schedules with set-up times included
    • S.M. Johnson Optimal two and three stage production schedules with set-up times included Naval Research Logistics Quaterly 1 1954 61 68
    • (1954) Naval Research Logistics Quaterly , vol.1 , pp. 61-68
    • Johnson, S.M.1
  • 21
    • 13444276408 scopus 로고    scopus 로고
    • Grouping on a single machine with heads and tails to represent a family of dominant schedules
    • Valencia, 3-5 April
    • P. Mauguière, J.-C. Billaut, C. Artigues, Grouping on a single machine with heads and tails to represent a family of dominant schedules. 8th Workshop on Project Management and Scheduling, Valencia, 3-5 April 2002, pp. 265-269.
    • (2002) 8th Workshop on Project Management and Scheduling , pp. 265-269
    • Mauguière, P.1    Billaut, J.-C.2    Artigues, C.3
  • 23
    • 0000927907 scopus 로고    scopus 로고
    • A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness
    • D. Wu, E.S. Byeon, and R.H. Storer A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness Operations Research 1 1999 113 124
    • (1999) Operations Research , vol.1 , pp. 113-124
    • Wu, D.1    Byeon, E.S.2    Storer, R.H.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.