Abstract
This paper investigates single-machine scheduling problems with deteriorating jobs and the group technology (GT) assumption. By deteriorating jobs and the group technology assumption, we mean that the group setup times and job processing times are both increasing functions of their starting times, i.e., the group setup times and job processing times are both described by a function which is proportional to a linear function of time. The two objectives of scheduling problems are to minimize the makespan and the total weighted completion time, respectively. We show that these problems remain solvable in polynomial time when deterioration and group technology are considered simultaneously.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Alidaee B, Womer NK (1999) Scheduling with time dependent processing times: review and extensions. J Oper Res Soc 50:711–720
Cheng TCE, Ding Q, Lin BMT (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152:1–13
Guo A-X, Wang J-B (2005) Single machine scheduling with deteriorating jobs under the group technology assumption. Int J Pure Appli Math 18:225–231
Janiak A, Kovalyov MY (2006) Scheduling in a contaminated area: a model and polynomial algorithms. Eur J Oper Res 173:125–132
Wang J-B, Ng CTD, Cheng TCE, Liu L-L (2006) Minimizing total completion time in a two-machine flow shop with deteriorating jobs. Appl Math Comput 180:185–193
Wang J-B, Xia Z-Q (2005) Scheduling jobs under decreasing linear deterioration. Inf Process Lett 94:63–69
Wang J-B, Xia Z-Q (2006) Flow shop scheduling with deteriorating jobs under dominating machines. Omega 34:327–336
Wang J-B, Xia Z-Q (2006) Flow shop scheduling problems with deteriorating jobs under dominating machines. J Oper Res Soc 57:220–226
Xu F, Guo A-X, Wang J-B, Shan F (2006) Single machine scheduling problem with linear deterioration under group technology. Int J Pure Appli Math 28:401–406
Gawiejnowicz S, Kurc W, Pankowska L (2006) Pareto and scalar bicriterion optimization in scheduling deteriorating jobs. Comput Oper Res 33:746–767
Gawiejnowicz S (2007) Scheduling deteriorating jobs subject to job or machine availability constraints. Eur J Oper Res 180:472–478
Wang J-B (2007) Flow shop scheduling problems with decreasing linear deterioration under dominant machines. Comput Oper Res 34:2043–2058
Wang J-B, Guo A-X, Shan F, Jiang B, Wang L-Y (2007) Single machine group scheduling under decreasing linear deterioration. J Appl Math Comput 24:283–293
Wu C-C, Shiau Y-R, Lee W-C (2007) Single-machine group scheduling problems with deterioration consideration. Comput Oper Res 35:1652–1659
Wu C-C, Lee W-C, Shiau Y-R (2007) Minimizing the total weighted completion time on a single machine under linear deterioration. Int J Adv Manuf Technol 33:1237–1243
Shiau Y-R, Lee W-C, Wu C-C, Chang C-M (2007) Two-machine flowshop scheduling to minimize mean flow time under simple linear deterioration. Int J Adv Manuf Technol 34:774–782
Wang J-B, Ng CT, Cheng TCE (2007) Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint. Comput Oper Res (in press)
Potts CN, Van Wassenhove LN (1992) Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J Oper Res Soc 43:395–406
Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, JB., Lin, L. & Shan, F. Single-machine group scheduling problems with deteriorating jobs. Int J Adv Manuf Technol 39, 808–812 (2008). https://doi.org/10.1007/s00170-007-1255-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-007-1255-x