처리순서기반 지수함수 학습효과를 고려한 2-에이전트 스케줄링
Two-Agent Scheduling with Sequence-Dependent Exponential Learning Effects Consideration
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
In this paper, we consider a two-agent scheduling with sequence-dependent exponential learning effects consideration, wheretwo agents A and B have to share a single machine for processing their jobs. The objective function for agent A is to minimizethe total completion time of jobs for agent A subject to a given upper bound on the objective function of agent B , representingthe makespan of jobs for agent B . By assuming that the learning ratios for all jobs are the same, we suggest an enumeration-basedbackward allocation scheduling for finding an optimal solution and exemplify it by using a small numerical example. This problemhas various applications in production systems as well as in operations management.
Abstract
In this paper, we consider a two-agent scheduling with sequence-dependent exponential learning effects consideration, wheretwo agents A and B have to share a single machine for processing their jobs. The objective function for agent A is to minimizethe total completion time of jobs for agent A subject to a given upper bound on the objective function of agent B , representingthe makespan of jobs for agent B . By assuming that the learning ratios for all jobs are the same, we suggest an enumeration-basedbackward allocation scheduling for finding an optimal solution and exemplify it by using a small numerical example. This problemhas various applications in production systems as well as in operations management.
참고문헌 (15)
- Agnetis, A., "Scheduling problems with two agents", Operations Research, 52(2), pp.229~242 (2004)
- Agnetis, A., "A Lagrangian approach to single-machine scheduling problems with two competing agents", Journal of scheduling, 12(4), pp.401~415 (2009)
- Bachman, A., "Scheduling jobs with position- dependent processing times", Journal of the operational research society, 55(3), pp.257~264 (2004)
- Biskup, D., "Single-machine scheduling with learning considerations", European Journal of Operational Research, 98(1-4), pp.273~290 (2000)
- Biskup, D., "A state-of-the-art review on scheduling with learning effects", European journal of operational research, 188(2), pp.315~329 (2008)
- Cheng, T.C.E., "Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs", Theoretical computer science, 362(1-3), pp.273~281 (2006)
- Choi, J.Y., "A numerical analysis of solution approaches for multi-agent scheduling problems", Proceeding of the 43rd international conference on computers and industrial engineering (2013)
- Graham, R.L., "Optimization and approximation in deterministic sequencing and scheduling theory : a survey", Annals of Discrete Mathematics, 5, pp.287~326 (1979)
- Liu, P., "Two-agent single-machine scheduling problems under increasing linear deterioration", Applied Mathematical Modelling, 35, pp.2290~2296 (2011)
- Mosheiov, G., "Scheduling problems with a learning effect", European Journal of Operational Research, 132(3), pp.687~693 (2001)
- Mosheiov, G., "A note on scheduling deteriorating jobs", Mathematical and Computer Modeling, 41(8-9), pp.883~886 (2005)
- Ng, C.T., "A note on the complexity of the problem of two-agent scheduling on a single machine", Journal of Combinatorial Optimization, 12(4), pp.387~394 (2006)
- Peng, L., "Two-agent singlemachine scheduling with position-dependent processing times", International Journal of Advanced Manufacturing Systems, 48(1-4), pp.325~331 (2010)
- Wan, G., "Scheduling two agents with controllable processing times", European Journal of Operational Research, 205(3), pp.528~539 (2010)
- Wang, J.B., "Single-machine scheduling jobs with exponential learning functions", Computers and Industrial Engineering, 60(4), pp.755~759 (2011)