메뉴 건너뛰기




Volumn 8, Issue 3, 2004, Pages 227-240

Equal processing time bicriteria scheduling on parallel machines

Author keywords

Bicriteria scheduling; Equal processing time jobs; Parallel machines

Indexed keywords

BICRITERIA SCHEDULING; EQUAL PROCESSING TIME JOBS; PARALLEL MACHINES; TIME ALGORITHMS;

EID: 4344713001     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JOCO.0000038909.06086.ed     Document Type: Article
Times cited : (9)

References (32)
  • 1
    • 0026243299 scopus 로고
    • Bicriteria scheduling problem involving total tardiness and total earliness penalties
    • M. Azizoglu and S.O. Kondacki, "Bicriteria scheduling problem involving total tardiness and total earliness penalties," International Journal of Production Economics, vol. 23, no. 1-3, 1991.
    • (1991) International Journal of Production Economics , vol.23 , Issue.1-3
    • Azizoglu, M.1    Kondacki, S.O.2
  • 2
    • 0026900932 scopus 로고
    • Multicriteria scheduling tool using a branch and bound algorithm
    • R. Bausch, "Multicriteria scheduling tool using a branch and bound algorithm," European Journal of Operational Research, vol. 61, no. 1/2, pp. 213-218, 1992.
    • (1992) European Journal of Operational Research , vol.61 , Issue.1-2 , pp. 213-218
    • Bausch, R.1
  • 3
    • 0026391973 scopus 로고
    • Bicriteria scheduling problem in a job shop with parallel processors
    • A.A. Cenna and M.T. Tabucanon, "Bicriteria scheduling problem in a job shop with parallel processors," International Journal of Production Economics, vol. 25, no. 1-3, pp. 95-101, 1991.
    • (1991) International Journal of Production Economics , vol.25 , Issue.1-3 , pp. 95-101
    • Cenna, A.A.1    Tabucanon, M.T.2
  • 4
    • 0006841666 scopus 로고
    • A note on single machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
    • S. Chand and Schneeberger, "A note on single machine scheduling problem with minimum weighted completion time and maximum allowable tardiness," Naval Research Logistics Quarterly, vol. 33, no. 3, pp. 551-557, 1986.
    • (1986) Naval Research Logistics Quarterly , vol.33 , Issue.3 , pp. 551-557
    • Chand, S.1    Schneeberger2
  • 5
    • 0002719862 scopus 로고
    • Scheduling unit processing time jobs on a single machine with multiple criteria
    • C.L. Chen and R.L. Bulfin, "Scheduling unit processing time jobs on a single machine with multiple criteria," Computers and Operations Research, vol. 17, pp. 1-17, 1989.
    • (1989) Computers and Operations Research , vol.17 , pp. 1-17
    • Chen, C.L.1    Bulfin, R.L.2
  • 6
    • 0027912254 scopus 로고
    • Complexity of single machine, multi-criteria scheduling problems
    • C.-L. Chen, and R.L. Bulfin, "Complexity of single machine, multi-criteria scheduling problems," European Journal of Operational Research, vol. 70, pp. 115-125, 1993.
    • (1993) European Journal of Operational Research , vol.70 , pp. 115-125
    • Chen, C.-L.1    Bulfin, R.L.2
  • 7
    • 0028499951 scopus 로고
    • Scheduling a single machine to minimize two criteria: Max tardiness and number of tardy jobs
    • C.-L. Chen and R.L. Bulfin, "Scheduling a single machine to minimize two criteria: Max tardiness and number of tardy jobs," IIE Transactions, vol. 26, pp. 76-84, 1994.
    • (1994) IIE Transactions , vol.26 , pp. 76-84
    • Chen, C.-L.1    Bulfin, R.L.2
  • 8
    • 0025692635 scopus 로고
    • Minimizing the flow time and missed due dates in a single machine sequencing
    • T.C.E. Cheng, "Minimizing the flow time and missed due dates in a single machine sequencing," Mathematical & Computer Modelling, vol. 13, no. 5, pp. 71-77, 1990.
    • (1990) Mathematical & Computer Modelling , vol.13 , Issue.5 , pp. 71-77
    • Cheng, T.C.E.1
  • 9
    • 0026157989 scopus 로고
    • Improve solution procedure for n/1/max {γ(C)} → Σ scheduling problem
    • T.C.E. Cheng, "Improve solution procedure for n/1/max {γ(C)} → Σ scheduling problem," Journal of Operations Research Society, vol. 42, no. 5, pp. 413-417, 1991.
    • (1991) Journal of Operations Research Society , vol.42 , Issue.5 , pp. 413-417
    • Cheng, T.C.E.1
  • 10
    • 0028768514 scopus 로고
    • Incorporating preference information into multi-objective scheduling
    • R.L. Daniels, "Incorporating preference information into multi-objective scheduling," European Journal of Operational Research, vol. 77, pp. 272-286, 1994.
    • (1994) European Journal of Operational Research , vol.77 , pp. 272-286
    • Daniels, R.L.1
  • 11
    • 0026367041 scopus 로고
    • Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine
    • P. De, J.B. Ghosh, and C.E. Wells, "Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine," Computer and Operations Research, vol. 18, no. 8, pp. 717-720, 1991.
    • (1991) Computer and Operations Research , vol.18 , Issue.8 , pp. 717-720
    • De, P.1    Ghosh, J.B.2    Wells, C.E.3
  • 12
    • 0026190328 scopus 로고
    • Bicriteria job shop scheduling with flowtime and sum square of lateness
    • P. Dileepan and T. Sen, "Bicriteria job shop scheduling with flowtime and sum square of lateness," Engineering Cost and Production Economics, vol. 21, no. 3, pp. 295-299, 1991.
    • (1991) Engineering Cost and Production Economics , vol.21 , Issue.3 , pp. 295-299
    • Dileepan, P.1    Sen, T.2
  • 13
    • 0000855797 scopus 로고
    • A framework for single machine multiple objective sequencing research
    • T.D. Fry, R.D. Armstrong, and H. Lemis, "A framework for single machine multiple objective sequencing research," Omega, vol. 17, pp. 595-607, 1989.
    • (1989) Omega , vol.17 , pp. 595-607
    • Fry, T.D.1    Armstrong, R.D.2    Lemis, H.3
  • 14
  • 15
    • 0011889109 scopus 로고
    • Interactive scheduling of a generalized flow shop, Part I: Success through evolutionary development
    • T.J. Hodgson and G.W. McDonald, "Interactive scheduling of a generalized flow shop, Part I: Success through evolutionary development," Interfaces, vol. 11, no. 2, pp. 42-47, 1981.
    • (1981) Interfaces , vol.11 , Issue.2 , pp. 42-47
    • Hodgson, T.J.1    McDonald, G.W.2
  • 16
    • 0030087378 scopus 로고    scopus 로고
    • Minimizing maximum promptness and maximum lateness on a single machine
    • J.A. Hoogeveen, "Minimizing maximum promptness and maximum lateness on a single machine," Mathematics of Operations Research, vol. 21, pp. 100-114, 1996a.
    • (1996) Mathematics of Operations Research , vol.21 , pp. 100-114
    • Hoogeveen, J.A.1
  • 17
    • 0030372948 scopus 로고    scopus 로고
    • Single machine scheduling to minimize a function of two or three maximum cost criteria
    • J.A. Hoogeveen, "Single machine scheduling to minimize a function of two or three maximum cost criteria," Journal of Algorithms, vol. 21, pp. 415-435, 1996b.
    • (1996) Journal of Algorithms , vol.21 , pp. 415-435
    • Hoogeveen, J.A.1
  • 18
    • 0029314136 scopus 로고
    • Minimizing total completion time and maximum cost simultaneously
    • J.A. Hoogeveen and S.L. van de Velde, "Minimizing total completion time and maximum cost simultaneously," Operations Research Letters, vol. 17, pp. 205-208, 1995.
    • (1995) Operations Research Letters , vol.17 , pp. 205-208
    • Hoogeveen, J.A.1    Van De Velde, S.L.2
  • 19
  • 20
    • 0022698428 scopus 로고
    • Scheduling with multiple performance measures: The one-machine case
    • K.T. Nelson, R.K. Sarin, and R.L. Daniels; "Scheduling with multiple performance measures: The one-machine case," Management Science, vol. 32, pp. 464-479, 1986.
    • (1986) Management Science , vol.32 , pp. 464-479
    • Nelson, K.T.1    Sarin, R.K.2    Daniels, R.L.3
  • 21
    • 0026106643 scopus 로고
    • Fuzzy goal programming in forestry, an application with special solution
    • J.B. Pickens and J.G. Hoff, "Fuzzy goal programming in forestry, an application with special solution," Fuzzy Sets and Systems, vol. 39, no. 3, pp. 239-246, 1991.
    • (1991) Fuzzy Sets and Systems , vol.39 , Issue.3 , pp. 239-246
    • Pickens, J.B.1    Hoff, J.G.2
  • 22
    • 0024925432 scopus 로고
    • Flow shop scheduling with lot streaming
    • C.N. Potts and K.R. Baker, "Flow shop scheduling with lot streaming," Operations Research Letters, vol. 8, no. 6, pp. 297-303, 1989.
    • (1989) Operations Research Letters , vol.8 , Issue.6 , pp. 297-303
    • Potts, C.N.1    Baker, K.R.2
  • 26
    • 4344595971 scopus 로고
    • Branch and bound approach to the bicriteria scheduling problem involving total flow time and range of lateness
    • T. Sen, F.M.E. Raizhel, and P. Dilelepan, "Branch and bound approach to the bicriteria scheduling problem involving total flow time and range of lateness," Management Science, vol. 23, pp. 1016-1019, 1977.
    • (1977) Management Science , vol.23 , pp. 1016-1019
    • Sen, T.1    Raizhel, F.M.E.2    Dilelepan, P.3
  • 27
    • 0002066821 scopus 로고
    • Various optimizers for single stage production
    • March
    • W.E. Smith, "Various optimizers for single stage production," Naval Research Logistics Quarterly, vol. 3, no. 1, March 1956.
    • (1956) Naval Research Logistics Quarterly , vol.3 , Issue.1
    • Smith, W.E.1
  • 29
    • 0029293687 scopus 로고
    • The single-machine scheduling problem to minimize total tardiness subject to minimum number of tardy jobs
    • G.L. Vairaktararis and C.-Y. Lee, "The single-machine scheduling problem to minimize total tardiness subject to minimum number of tardy jobs," IIE Transactions, vol. 27, no. 2, pp. 250-256, 1995.
    • (1995) IIE Transactions , vol.27 , Issue.2 , pp. 250-256
    • Vairaktararis, G.L.1    Lee, C.-Y.2
  • 31
    • 0026896286 scopus 로고
    • Two and three machine flow shop scheduling porblems with equal sized transfer batches
    • R.G. Vickson and B.E. Alfredson, "Two and three machine flow shop scheduling porblems with equal sized transfer batches," International Journal of Production Research, vol. 30, pp. 1551-1574, 1992.
    • (1992) International Journal of Production Research , vol.30 , pp. 1551-1574
    • Vickson, R.G.1    Alfredson, B.E.2
  • 32
    • 0022093184 scopus 로고
    • Scheduling algorithms for flexible flow lines
    • R.J. Wittrock, "Scheduling algorithms for flexible flow lines," IBM Journal of Research and Development, vol. 29, pp. 401-412, 1985.
    • (1985) IBM Journal of Research and Development , vol.29 , pp. 401-412
    • Wittrock, R.J.1


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