Two-machine flowshop scheduling to minimize mean flow time under simple linear deterioration

International Journal of Advanced Manufacturing Technology

Volumn 34, Issue 7-8, 2007, Pages 774-782

  Shiau, Yau Ren ^a   Lee, Wen Chiung ^a   Wu, Chin Chia ^a   Chang, Chia Ming ^a  

^a FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

Linear deterioration; Mean flow time; Production

Indexed keywords

COMPUTATIONAL METHODS; HEURISTIC ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; PRODUCTION CONTROL;

INDUSTRIAL PRODUCTION; LINEAR DETERIORATION; MEAN FLOW TIME;

SCHEDULING;

EID: 34548602397     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-006-0646-8     Document Type: Article

References (24)

1. Gupta JND, Gupta SK (1988) Single facility scheduling with nonlinear processing times. Comput Ind Eng 14:387-393
2. Mosheiov G (1996) Λ-shaped policies to schedule deteriorating jobs. J Oper Res Soc 47:1184-1191
3. Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38:495-498
4. Alidaee B, Womer NK (1999) Scheduling with time-dependent processing times: review and extensions. J Oper Res Soc 50:711-720
5. Cheng TCE, Ding Q, Lin BMT (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152:1-13
6. Mosheiov G (1991) V-shaped policies for scheduling jobs. Comput Oper Res 39:979-991
7. Mosheiov G (1994) Scheduling jobs under simple linear deterioration. Comput Oper Res 21(6):653-659
8. Ho KIJ, Leung JYT, Wei WD (1993) Complexity of scheduling tasks with time-dependent execution times. Inf Process Lett 48:315-320
9. Gawiejnowicz S, Pankowska L (1995) Scheduling jobs with varying processing times. Inf Process Lett 54(3):175-178
10. Cheng TCE, Ding Q (1999) The time-dependent machine makespan problem is strongly NP-complete. Comput Oper Res 26(8):749-754
11. Cheng TCE, Ding Q (2003) Scheduling start-time-dependent tasks with deadlines and identical initial processing time on a single machine. Comput Oper Res 30(1):51-62
12. Wang JB, Xia ZQ (2005) Scheduling jobs under decreasing linear deterioration. Inf Process Lett 94:63-69
13. Chen ZL (1996) Parallel machine scheduling with time-dependent processing times. Discrete Appl Math 70(1):81-93
14. Hsieh YC, Bricker DL (1997) Scheduling linearly deteriorating jobs on multiple machines. Comput Ind Eng 32:727-734
15. Kononov A, Gawiejnowicz S (2001) NP-hard cases in scheduling deteriorating jobs on dedicated machines. J Oper Res Soc 52(6):708-717
16. Mosheiov G (2002) Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Appl Math 117(1-3):195-209
17. Wang JB, Xia ZQ (2005) Flow shop scheduling problems with deteriorating jobs under dominating machines. J Oper Res Soc 56:1-7
18. Panwalkar SS, Smith ML, Seidmann A (1982) Common due date assignment to minimize total penalty for the one machine scheduling problem. Oper Res 30(2):391-399
19. i scheduling problems. Int J Prod Econ 44:225-237
20. Kirkpatrick S, Gelatt C, Vecchi M (1983) Optimization by simulated annealing. Science 20/4598:671-680
21. Low CY, Yeh JY, Huang KI (2004) A robust simulated annealing heuristic for flow shop scheduling problems. Int J Adv Manuf Technol 23:762-767
22. Lee WC, Wu CC, Chen P (2006) A simulated annealing approach to makespan minimization on identical parallel machines. Int J Adv Manuf Technol (available online)
23. Wu CC, Lee WC, Wang WC (2006) A two-machine flowshop maximum tardiness scheduling problem with a learning effect. Int J. Adv Manuf Technol (available online)
24. Ben-Arieh D, Maimon O (1992) Annealing method for PCB assembly scheduling on two sequential machines. Int J Comput Integr Manuf 5/6:361-367