Sustainable Production Scheduling in Open Innovation Perspective under the Fourth Industrial Revolution
Abstract
:1. Introduction
2. Mathematical Programming
- (i)
- All of the lots to be scheduled should have arrived before scheduling.
- (ii)
- Production by splitting lots is not prohibited.
- (iii)
- Equipment can not process more than two lots simultaneously.
- Eg a set of designated equipment that can process lots in group g according the recipe.
- Lg a set of lots that are in group g according to recipe.
- sg setup time of a lot in Lg.
- pg processing time of a lot in Lg.
- xgle decision variable that is 1 if lot l in group Lg is scheduled on equipment e in Eg.
- tge decision variable that is 1 if lot in group Lg is scheduled on equipment e in Eg.
3. Heuristics
- Step 1
- For the current schedule, find equipment in which processing can be started first, that is, select equipment with the smallest load.
- Step 2
- Select a lot with the highest priority computed by the five rules developed above. Note that five different schedules can be obtained.
- Step 3
- Assign the selected lot, and then update all the information.
- Step 4
- Repeat this procedure until there is no lot to be scheduled.
4. Simulation Study
5. Concluding Remarks
Author Contributions
Conflicts of Interest
References
- Greco, M.; Grimaldi, M.; Cricelli, L. Hitting the nail on the head: Exploring the relationship between public subsidies and open innovation efficiency. Technol. Forecast. Soc. Chang. 2017, 118, 213–225. [Google Scholar] [CrossRef]
- Barge-Gil, A. Open, semi-open and closed innovators: Towards an explanation of degree of openness. Ind. Innov. 2010, 17, 577–607. [Google Scholar] [CrossRef]
- Dahlander, L.; Gann, D.M. How open is innovation? Res. Policy 2010, 39, 699–709. [Google Scholar] [CrossRef]
- Huizingh, E.K.R.E. Open innovation: State of the art and future perspectives. Technovation 2011, 31, 2–9. [Google Scholar] [CrossRef]
- Gassmann, O.; Enkel, E.; Chesbrough, H.W. The future of open innovation. R D Manag. 2010, 40, 213–221. [Google Scholar] [CrossRef] [Green Version]
- Yun, J.H. How do we conquer the growth limits of capitalism? Schumpeterian Dynamics of Open Innovation. J. Open Innov. Technol. Mark. Complex. 2015, 1, 17. [Google Scholar] [CrossRef]
- Lara, A.P.; Da Costa, E.M.; Furlani, T.Z.; Yigitcanla, T. Smartness that matters: Towards a comprehensive and human-centred characterisation of smart cities. J. Open Innov. Technol. Mark. Complex. 2016, 2. [Google Scholar] [CrossRef]
- Yun, J.H.; Won, D.K.; Park, K.B. Dynamics from open innovation to evolutionary change. J. Open Innov. Technol. Mark. Complex. 2016, 2. [Google Scholar] [CrossRef]
- Graham, R.L. Bounds on multiprocessor timing anomalies. SIAM J. Appl. Math. 1969, 17, 416–429. [Google Scholar] [CrossRef]
- Allahverdi, A.; Gupta, J.N.D.; Aldowaisan, T. A review of scheduling research involving setup considerations. OMEGA-Int. J. Manag. Sci. 1999, 27, 219–239. [Google Scholar] [CrossRef]
- Wu, M.C.; Huang, Y.L.; Chang, Y.C.; Yang, K.F. Dispatching in semiconductor fabs with machine-dedication features. Int. J. Adv. Manuf. Technol. 2006, 28, 978–984. [Google Scholar] [CrossRef]
- Tang, C.S.; Wittrock, R.J. Parallel Machine Scheduling with Major and Minor Setups; IBM TJ Watson Research Center: York Town Heights, NY, USA, 1985. [Google Scholar]
- So, K.C. Some heuristics for scheduling lots on parallel machines with setups. Manag. Sci. 1990, 36, 467–475. [Google Scholar] [CrossRef]
- Tang, C.S. Scheduling batches on parallel machines with major and minor setups. Eur. J. Oper. Res. 1990, 46, 28–37. [Google Scholar] [CrossRef]
- Goemans, M.X. An approximation algorithm for scheduling on three designated machines. Discret. Appl. Math. 1995, 61, 49–59. [Google Scholar] [CrossRef]
- Kellerer, H.; Strusevich, V.A. Scheduling problems for parallel designated machines under multiple resource constraints. Discret. Appl. Math. 2004, 133, 45–68. [Google Scholar] [CrossRef]
- Lee, D.H.; Kim, Y.D. Scheduling algorithms for flexible manufacturing systems with partially grouped machines. J. Manuf. Syst. 1999, 18, 301–309. [Google Scholar] [CrossRef]
- Shim, S.O.; Choi, S.W. Scheduling Jobs on Dedicated Parallel Machines. Appl. Mech. Mater. 2013, 433–435, 2363–2366. [Google Scholar] [CrossRef]
Lots † | Group ‡ | Equipment ** | Largest Processing and Setup Time (LPST) | Smallest Processing and Setup Time (SPST) | Total Remaining Processing Time (TRPT) | Maximum Number of Remaining Lots (MNRL) | TRPT/MNRL |
---|---|---|---|---|---|---|---|
40 | 6 | 5 | 36 * | 70 | 2 | 1 | 11 |
10 | 6 | 92 | 3 | 3 | 8 | ||
12 | 5 | 22 | 82 | 1 | 2 | 10 | |
10 | 32 | 66 | 1 | 1 | 9 | ||
80 | 6 | 5 | 22 | 78 | 3 | 2 | 10 |
10 | 14 | 62 | 2 | 3 | 14 | ||
12 | 5 | 12 | 76 | 4 | 2 | 13 | |
10 | 16 | 66 | 3 | 1 | 18 |
© 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
Share and Cite
Shim, S.-O.; Park, K.; Choi, S. Sustainable Production Scheduling in Open Innovation Perspective under the Fourth Industrial Revolution. J. Open Innov. Technol. Mark. Complex. 2018, 4, 42. https://doi.org/10.3390/joitmc4040042
Shim S-O, Park K, Choi S. Sustainable Production Scheduling in Open Innovation Perspective under the Fourth Industrial Revolution. Journal of Open Innovation: Technology, Market, and Complexity. 2018; 4(4):42. https://doi.org/10.3390/joitmc4040042
Chicago/Turabian StyleShim, Sang-Oh, KyungBae Park, and SungYong Choi. 2018. "Sustainable Production Scheduling in Open Innovation Perspective under the Fourth Industrial Revolution" Journal of Open Innovation: Technology, Market, and Complexity 4, no. 4: 42. https://doi.org/10.3390/joitmc4040042