Single machine quadratic penalty function scheduling with deteriorating jobs and group technology

Applied Mathematical Modelling

Volumn 34, Issue 11, 2010, Pages 3642-3647

  Wei, Cai Min ^a   Wang, Ji Bo ^b,c  

^a SHANTOU UNIVERSITY   (China)

^b SHENYANG UNIVERSITY   (China)

^c XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

Deteriorating jobs; Group technology; Scheduling; Single machine

Indexed keywords

COMPLETION TIME; DETERIORATING JOBS; LINEAR FUNCTIONS; POLYNOMIAL-TIME ALGORITHMS; PROCESSING TIME; QUADRATIC PENALTY FUNCTION; SCHEDULING PROBLEM; SINGLE MACHINE SCHEDULING PROBLEMS; SINGLE MACHINES; WAITING TIME; WEIGHTED SUM;

DETERIORATION; MACHINERY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; TECHNOLOGY;

GROUP TECHNOLOGY;

EID: 77952955336     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2010.03.014     Document Type: Article

References (27)

1. Alidaee B., Womer N.K. Scheduling with time dependent processing times: review and extensions. J. Oper. Res. Soc. 1999, 50:711-720.
2. Cheng T.C.E., Ding Q., Lin B.M.T. A concise survey of scheduling with time dependent processing times. Eur. J. Oper. Res. 2004, 152:1-13.
3. Gawiejnowicz S. Time-dependent Scheduling 2008, Springer, Berlin, ISBN 978-3-540-69445-8.
4. Browne S., Yechiali U. Scheduling deteriorating jobs on a single processor. Oper. Res. 1990, 38:495-498.
5. Mosheiov G. V-shaped policies for scheduling deteriorating jobs. Oper. Res. 1991, 39:979-991.
6. Mosheiov G. Scheduling jobs under simple linear deterioration. Comput. Oper. Res. 1994, 21:653-659.
7. Sundararaghavan P.S., Kunnathur A.S. Single machine scheduling with start time dependent processing times: some solvable cases. Eur. J. Oper. Res. 1994, 78:394-403.
8. Wang J.-B., Xia Z.-Q. Scheduling jobs under decreasing linear deterioration. Inform. Process. Lett. 2005, 94:63-69.
9. Chen Z.-L. Parallel machine scheduling with time dependent processing times. Discrete Appl. Math. 1996, 70:81-94.
10. Hsieh Y.C., Bricker D.L. Scheduling linearly deteriorating jobs on multiple machines. Comput. Ind. Eng. 1997, 32:727-734.
11. Mosheiov G. Multi-machine scheduling with linear deterioration. INFOR 1998, 36:205-214.
12. Mosheiov G. Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Appl. Math. 2002, 117:195-209.
13. Kononov A., Gawiejnowicz S. NP-hard cases in scheduling deteriorating jobs on dedicated machines. J. Oper. Res. Soc. 2001, 52:708-717.
14. Wang J.-B., Xia Z.-Q. Flow shop scheduling with deteriorating jobs under dominating machines. Omega 2006, 34:327-336.
15. Wang J.-B., Xia Z.-Q. Flow shop scheduling problems with deteriorating jobs under dominating machines. J. Oper. Res. Soc. 2006, 57:220-226.
16. Wang J.-B. Flow shop scheduling problems with decreasing linear deterioration under dominant machines. Comput. Oper. Res. 2007, 34:2043-2058.
17. Mitrofanov S.P. Scientific Principles of Group Technology 1966, National Lending Library, London, UK.
18. Potts C.N., Van Wassenhove L.N. Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J. Oper. Res. Soc. 1992, 43:395-406.
19. Ng C.T., Cheng T.C.E., Janiak A., Kovalyov M.Y. Group scheduling with controllable setup and processing times: minimizing total weighted completion time. Ann. Oper. Res. 2005, 133:147-163.
20. Wu C.-C., Shiau Y.-R., Lee W.-C. Single machine group scheduling problems with deterioration consideration. Comput. Oper. Res. 2008, 35:1652-1659.
21. Wu C.-C., Lee W.-C. Single machine group scheduling problems with deteriorating setup times and job processing times. Int. J. Prod. Econ. 2008, 115:128-133.
22. Wang J.-B., Lin L., Shan F. Single machine group scheduling problems with deteriorating jobs. Int. J. Adv. Manuf. Technol. 2008, 39:808-812.
23. Wang J.-B., Gao W.-J., Wang L.-Y., Wang D. Single machine group scheduling with general linear deterioration to minimize the makespan. Int. J. Adv. Manuf. Technol. 2009, 43:146-150.
24. Graham R.L., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 1979, 5:287-326.
25. Townsend W. The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution. Manag. Sci. 1978, 24:530-534.
26. Szwarc W., Posner M.E., Liu J.J. The single machine problem with a quadratic cost function of completion times. Manag. Sci. 1988, 34:1480-1488.
27. Szwarc W., Mukhopadhyay S.K. Minimizing a quadratic cost function of waiting times in single machine scheduling. J. Oper. Res. Soc. 1995, 46:753-761.