SCOPUS 정보 검색 플랫폼

Volumn 49, Issue 8, 2002, Pages 760-780

Minimizing weighted earliness and tardiness penalties in single-machine scheduling with idle time permitted

Author keywords

Branch and bound; Dominance rule; Earliness tardiness; Idle time; Scheduling theory

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MATRIX ALGEBRA; PROBLEM SOLVING;

SINGLE-MACHINE SCHEDULING;

SCHEDULING;

EID: 0036905049 PISSN: 0894069X EISSN: None Source Type: Journal
DOI: 10.1002/nav.10039 Document Type: Article

Times cited : (6)

References (11)

1
- 0023965120
- Dynamic programming state-space relaxation for single machine scheduling
- T.S. Abdul-Razaq and C.N. Ports, Dynamic programming state-space relaxation for single machine scheduling, J Oper Res Soc 39 (1988), 141-152.
- (1988) J Oper Res Soc , vol.39 , pp. 141-152
- Abdul-Razaq, T.S.¹ Ports, C.N.²

2
- 0025211593
- Sequencing with earliness and tardiness penalties: A review
- K.R. Baker and G.D. Scudder, Sequencing with earliness and tardiness penalties: A review, Oper Res 38 (1990), 22-36.
- (1990) Oper Res , vol.38 , pp. 22-36
- Baker, K.R.¹ Scudder, G.D.²

3
- 0027542554
- Single-machine scheduling with early and tardy completion costs
- J.S. Davis and J.J. Kanet, Single-machine scheduling with early and tardy completion costs, Nav Res Logistics 40 (1993), 85-101.
- (1993) Nav Res Logistics , vol.40 , pp. 85-101
- Davis, J.S.¹ Kanet, J.J.²

4
- 0024010206
- One-processor scheduling with symmetric earliness and tardiness penalties
- M.R. Garey, R.E. Tarjan, and G.T. Wilfong, One-processor scheduling with symmetric earliness and tardiness penalties, Math Oper Res 13 (1988), 330-348.
- (1988) Math Oper Res , vol.13 , pp. 330-348
- Garey, M.R.¹ Tarjan, R.E.² Wilfong, G.T.³

5
- 0028734441
- Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
- Y.C. Kim and C.A. Yano, Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates, Nav Res Logistics 41 (1994), 913-933.
- (1994) Nav Res Logistics , vol.41 , pp. 913-933
- Kim, Y.C.¹ Yano, C.A.²

6
- 0000285949
- Single-machine scheduling with time windows and earliness/tardiness penalties
- C. Koulamas, Single-machine scheduling with time windows and earliness/tardiness penalties, Eur J Oper Res 91 (1996), 190-202.
- (1996) Eur J Oper Res , vol.91 , pp. 190-202
- Koulamas, C.¹

7
- 0000245614
- The single machine early/tardy problems
- P.S. Ow and T.E. Morton, The single machine early/tardy problems, Manage Sci 35 (1989), 177-191.
- (1989) Manage Sci , vol.35 , pp. 177-191
- Ow, P.S.¹ Morton, T.E.²

8
- 0003438602
- Prentice Hall, Englewood Cliffs, NJ
- M. Pinedo, Scheduling, theory, algorithm, and systems, Prentice Hall, Englewood Cliffs, NJ, 1996.
- (1996) Scheduling, theory, algorithm, and systems
- Pinedo, M.¹

9
- 0027557236
- Adjacent orderings in single-machine scheduling with earliness and tardiness penalties
- W. Szwarc, Adjacent orderings in single-machine scheduling with earliness and tardiness penalties, Nay Res Logistics 40 (1993), 229-243.
- (1993) Nay Res Logistics , vol.40 , pp. 229-243
- Szwarc, W.¹

10
- 84977334714
- Optimal timing schedules in earliness-tardiness single machine sequencing
- W. Szwarc and S.K. Mukhopadhyay, Optimal timing schedules in earliness-tardiness single machine sequencing, Nav Res Logistics 42 (1995), 1109-1114.
- (1995) Nav Res Logistics , vol.42 , pp. 1109-1114
- Szwarc, W.¹ Mukhopadhyay, S.K.²

11
- 0001399202
- A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time
- J.A. Hoogeveen and S.L. Van de Velde, A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time, INFORMS J Comput 8 (1996), 402-412.
- (1996) INFORMS J Comput , vol.8 , pp. 402-412
- Hoogeveen, J.A.¹ Van de Velde, S.L.²

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