Concurrent Solution of WATC Scheduling with WPPW Due Date Assignment for Environmentally Weighted Customers, Jobs and Services Using SA and its Hybrid

Halil Ibrahim Demir, Caner Erden, Abdullah Hulusi Kökçam, Ozer Uygun

Abstract


After industrial revolution environmental problems increased drastically. Air, water and soil pollution became a serious threat for the mankind. In order to overcome this threat everyone should take responsibility and try to preserve environment as much as possible. Environmentally conscious actions, people, law and foundations should be supported. When it came to determining due dates and scheduling, one of the important criteria should be the supporting the environment. In this study environmentally conscious customers, jobs, and services are rewarded, on the other hand unconscious customers, jobs, and services are penalized, while determining due dates and schedules. Simulated annealing and its hybrid with random search are applied to get environmentally better due dates and schedules.

Keywords


Environmental Due-Date Assignment Environmental Scheduling Simulated Annealing, Hybrid Simulated Annealing

Full Text:

PDF

References


BP Statistical Review of World Energy [Internet]. 2013 [cited 2018 Apr 14]. Available from: http://bp.com/statisticalreview

Briefing US. International Energy Outlook 2013. US Energy Information Administration. 2013;

Iovane F, Yoshikawa H, Alting L, Boer CR, Westkamper E, Williams D, et al. The incoming global technological and industrial revolution towards competitive sustainable manufacturing. CIRP ANNALS. 2007; 57:641–659.

Bull SR. Renewable energy today and tomorrow. Proceedings of the IEEE. 2001;89(8):1216–1226.

Jones CH. An Economic Evaluation of Job Shop Dispatching Rules. Management Science. 1973 Nov;20(3):293–307.

O’Driscoll E, O’Donnell GE. Industrial power and energy metering–a state-of-the-art review. Journal of Cleaner Production. 2013; 41:53–64.

Agnetis A, Mirchandani PB, Pacciarelli D, Pacifici A. Nondominated schedules for a job-shop with two competing users. Computational & Mathematical Organization Theory. 2000;6(2):191–217.

Zhang Z, Tang R, Peng T, Tao L, Jia S. A method for minimizing the energy consumption of machining system: integration of process planning and scheduling. Journal of cleaner production. 2016; 137:1647–1662.

Li X, Gao L, Shao X, Zhang C, Wang C. Mathematical modeling and evolutionary algorithm-based approach for integrated process planning and scheduling. Computers & Operations Research. 2010;37(4):656–667.

Amin-Naseri MR, Afshari AJ. A hybrid genetic algorithm for integrated process planning and scheduling problem with precedence constraints. The International Journal of Advanced Manufacturing Technology. 2012;59(1–4):273–287.

Shao X, Li X, Gao L, Zhang C. Integration of process planning and scheduling—a modified genetic algorithm-based approach. Computers & Operations Research. 2009;36(6):2082–2096.

Lihong Q, Shengping L. An improved genetic algorithm for integrated process planning and scheduling. The International Journal of Advanced Manufacturing Technology. 2012;58(5–8):727–740.

Liu S, Qu L. A new field balancing method of rotor systems based on holospectrum and genetic algorithm. Applied Soft Computing. 2008;8(1):446–455.

Li X, Gao L, Shao X. An active learning genetic algorithm for integrated process planning and scheduling. Expert Systems with Applications. 2012;39(8):6683–6691.

Moon C, Seo Y. Evolutionary algorithm for advanced process planning and scheduling in a multi-plant. Computers & Industrial Engineering. 2005;48(2):311–325.

Shukla SK, Tiwari MK, Son YJ. Bidding-based multi-agent system for integrated process planning and scheduling: a data-mining and hybrid tabu-SA algorithm-oriented approach. The International Journal of Advanced Manufacturing Technology. 2008;38(1–2):163.

Guo YW, Li WD, Mileham AR, Owen GW. Applications of particle swarm optimisation in integrated process planning and scheduling. Robotics and Computer-Integrated Manufacturing. 2009;25(2):280–288.

Guo YW, Li WD, Mileham AR, Owen GW. Optimisation of integrated process planning and scheduling using a particle swarm optimisation approach. International Journal of Production Research. 2009;47(14):3775–3796.

Li X, Zhang C, Gao L, Li W, Shao X. An agent-based approach for integrated process planning and scheduling. Expert Systems with Applications. 2010;37(2):1256–1264.

Wong TN, Leung CW, Mak KL, Fung RYK. An agent-based negotiation approach to integrate process planning and scheduling. International journal of production research. 2006;44(7):1331–1351.

Leung CW, Wong TN, Mak K-L, Fung RY. Integrated process planning and scheduling by an agent-based ant colony optimization. Computers & Industrial Engineering. 2010;59(1):166–180.

Luss H, Rosenwein MB. A due date assignment algorithm for multiproduct manufacturing facilities. European Journal of Operational Research. 1993;65(2):187–98.

Yang T, He Z, Cho KK. An effective heuristic method for generalized job shop scheduling with due dates. Computers & Industrial Engineering. 1994;26(4):647–60.

Cai X, Lum VYS, Chan JMT. Scheduling about a common due date with kob-dependent asymmetric earliness and tardiness penalties. European journal of operational research. 1997;98(1):154–168.

Chen D, Li S, Tang G. Single machine scheduling with common due date assignment in a group technology environment. Mathematical and Computer Modelling. 1997;25(3):81–90.

Kovalyov MY. Batch scheduling and common due date assignment problem: An NP-hard case. Discrete Applied Mathematics. 1997;80(2–3):251–4.

Gordon V, Kubiak W. Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs. Information Processing Letters. 1998;68(3):153–9.

Adamopoulos GI, Pappis CP. Scheduling under a common due-data on parallel unrelated machines. European Journal of Operational Research. 1998;105(3):494–501.

Cheng TCE, Kovalyov MY. Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness. European Journal of Operational Research. 1999;114(2):403–10.

Gordon VS, Strusevich VA. Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment. Computers & Operations Research. 1999;26(2):157–177.

Biskup D, Jahnke H. Common due date assignment for scheduling on a single machine with jointly reducible processing times. International Journal of Production Economics. 2001;69(3):317–22.

Mosheiov G. A common due-date assignment problem on parallel identical machines. Computers and Operations Research. 2001;28(8):719–32.

Gupta JND, Krüger K, Lauff V, Werner F, Sotskov YN. Heuristics for hybrid flow shops with controllable processing times and assignable due dates. Computers and Operations Research. 2002;29(10):1417–39.

Qi X, Yu G, Bard JF. Single machine scheduling with assignable due dates. Discrete Applied Mathematics. 2002;122(1–3):211–33.

Gordon VS, Proth J-M, Chu C. Due date assignment and scheduling: Slk, TWK and other due date assignment models. Production Planning & Control. 2002;13(2):117–32.

Ng Daniel CTD, Cheng TCE, Kovalyov MY, Lam SS. Single machine scheduling with a variable common due date and resource-dependent processing times. Computers and Operations Research. 2003;30(8):1173–85.

Birman M, Mosheiov G. A note on a due-date assignment on a two-machine flow-shop. Computers and Operations Research. 2004;31(3):473–80.

Lauff V, Werner F. Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey. Mathematical and Computer Modelling. 2004;40(5–6):637–55.

Min L, Cheng W. Genetic algorithms for the optimal common due date assignment and the optimal scheduling policy in parallel machine earliness/tardiness scheduling problems. Robotics and Computer-Integrated Manufacturing. 2006;22(4):279–87.

Mosheiov G, Yovel U. Minimizing weighted earliness–tardiness and due-date cost with unit processing-time jobs. European Journal of Operational Research. 2006;172(2):528–544.

Wang JB. Single machine scheduling with common due date and controllable processing times. Applied Mathematics and Computation. 2006;174(2):1245–54.

Baykasoǧlu A, Göçken M, Unutmaz ZD. New approaches to due date assignment in job shops. European Journal of Operational Research. 2008;187(1):31–45.

Xia Y, Chen B, Yue J. Job sequencing and due date assignment in a single machine shop with uncertain processing times. European Journal of Operational Research. 2008;184(1):63–75.

Shabtay D. Due date assignments and scheduling a single machine with a general earliness/tardiness cost function. Computers and Operations Research. 2008;35(5):1539–45.

Gordon VS, Strusevich VA. Single machine scheduling and due date assignment with positionally dependent processing times. European Journal of Operational Research. 2009;198(1):57–62.

Allaoua H, Osmane I. Variable parameters lengths genetic algorithm for minimizing earliness-tardiness penalties of single machine scheduling with a common due date. Electronic Notes in Discrete Mathematics. 2010;36(C):471–8.

Huynh Tuong N, Soukhal A. Due dates assignment and JIT scheduling with equal-size jobs. European Journal of Operational Research. 2010;205(2):280–9.

Yin Y, Cheng TCE, Xu D, Wu C-C. Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost. Computers & Industrial Engineering. 2012;63(1):223–234.

Li S, Ng CT, Yuan J. Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine. International Journal of Production Economics. 2011;131(2):747–51.

Vinod V, Sridharan R. Simulation modeling and analysis of due-date assignment methods and scheduling decision rules in a dynamic job shop production system. International Journal of Production Economics. 2011;129(1):127–46.

Kirkpatrick S, Gelatt CD, Vecchi MP. Optimization by simulated annealing. science. 1983;220(4598):671–680.

Press WH, Teukolsky SA, Vetterling WT, Flannery BP. Numerical Recipes 3rd Edition: The Art of Scientific Computing. 3rd ed. New York, NY, USA: Cambridge University Press; 2007.




DOI: http://dx.doi.org/10.21533/pen.v6i2.186

Refbacks

  • There are currently no refbacks.


Copyright (c) 2019 Halil Ibrahim Demir, Caner Erden, Abdullah Hulusi Kökçam, Ozer Uygun

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

ISSN: 2303-4521

Digital Object Identifier DOI: 10.21533/pen

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License