How to cite this paper
Singla, S., Kaur, H., Gupta, D & Kaur, J. (2024). No idle flow shop scheduling models with separated set-up times and concept of job weightage to optimize rental cost of machines.Journal of Project Management, 9(2), 101-108.
Refrences
Adiri, I., & Pohoryles, D. (1982). Flow shop no-idle or no-wait scheduling to minimize the sum of completion times. Naval Research Logistics, 29(3), 495–504.
Allahverdi, A., Gupta, J. N. D., & Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Omega, International Journal Management Science, 27(2), 219–239. https://doi.org/10.1016/S0305-0483(98)00042-5
Baraz, D., & Mosheiov, G. (2008). A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time. European Journal of Operational Research, 184, 810–813.
Campbell, H. G., Dudek, R. A., & Smith, M. L. (1970). A heuristic algorithm for the n job, m machine sequencing problem. Management Science, 16(10), B630–B637.
Chen, J., Wang, L., & Peng, Z. (2019). A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow-shop scheduling. Swarm and Evolutionary Computation, 50, 100557. https://doi.org/10.1016/j.swevo.2019.100557
Deng, G., & Gu, X. (2012). A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop sched-uling problem with makespan criterion. Computers and Operations Research, 39(9), 2152–2160.
Goncharov, Y., & Sevastyanov, S. (2009). The flow shop problem with noidle constraints: A review and approximation. European Journal of Operational Research, 196(2), 450–456.
Gupta, D., Goel, R., & Kaur, H. (2021). Optimizing rental cost with no idle constraints in two machines with weightage. Materials Today: Proceedings. https://doi.org/10.1016/j.matpr.2021.01.090
Gupta D., Shashi B., S. S. (2012). To Minimize The Rental Cost For 3- Stage Specially Structured Flow Shop Scheduling with Job Weightage. International Journal of Engineering Research and Applications (IJERA), 2(3), 912–916.
Ignall, E, S. L. (1965). Application of the branch and bound technique to some flow-shop scheduling problems. Operations Research, 13(3), 400–412.
Jackson, J. R. (1956). An extension of Johnson’s results on job IDT scheduling. Naval Research Logistics Quarterly, 3(3), 201–203.
Johnson, S.M. (1954). Optimal two‐and three‐stage production schedules with setup times included. Naval Research Logis-tics (NRL), 1(1), 61–68.
KALCZYNSKI, P. J., & KAMBUROWSKI, J. (2005). A heuristic for minimizing the makespan in no-idle permutation flow shops. Computers and Industrial Engineering, 49(1), 146–154.
Kim, S. C., & Bobrowski, P. M. (1994). Impact of Sequence-Dependent Setup Time on Job Shop Scheduling Performance. International Journal of Production Research, 32(7), 1503–1520.
Kumari, S., Khurana, P., & Singla, S. (2021). RAP via constraint optimization genetic algorithm. Life Cycle Reliability and Safety Engineering, 10(4), 341–345. https://doi.org/10.1007/s41872-021-00173-0
Kumari, S., Khurana, P., & Singla, S. (2022). Behavior and profit analysis of a thresher plant under steady state. Interna-tional Journal of System Assurance Engineering and Management, 13(1), 166–171. https://doi.org/10.1007/s13198-021-01183-y
Maggu, P. L., & Das, G. (1982). Weighted flow shop scheduling Problem. In Elements of Advanced Production Scheduling (1985th ed., pp. 105–111). United Publishers and Periodical distribution.
Miyazaki, S., Nishiyama, N. (1980). Analysis for minimizing weighted mean Minimizing rental cost in two stage flow shop, the processing time associated with probabilities including job block. Reflections de ERA, 1(2), 107–120.
Nawaz, M., Enscore Jr., E. E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. The International Journal of Management Science, 11(1), 91–95.
PALMER, D. S. (1985). Sequencing jobs through a multi stage process in the minimum total time-A quick method for ob-taining a near optimum. Operations Research, 16, 101–107.
Pan, Q. K., & Wang, L. (2008a). A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems. European Journal of Industrial Engineering, 2(3), 279–297.
Pan, Q. K., & Wang, L. (2008b). No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm op-timization algorithm. International Journal of Advanced Manufacturing Technonlogy., 39(7–8), 796–807.
Rad, S. F., Ruiz, R., & Boroojerdian, N. (2009). New high performing heuristics for minimizing makespan in permutation flowshops. OMEGA, the International Journal of Management Science, 37, 331–345.
RUIZ, R., & STÜTZLE, T. (2007). A simple and effective iterated greedy algorithm for the permutation flowshop schedul-ing problem. European Journal of Operational Research, 177(3), 2033–2049.
Ruiz, R., Vallada, E., & Fernández-Martínez, C. (2009). Scheduling in Flowshops with No-Idle Machines. In U. K. Chakraborty (Ed.), Computational intelligence in flow shop and job shop scheduling (Vol. 230, pp. 21–51). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-02836-6_2
Shao, W., Pi, D., & Shao, Z. (2018). Local search methods for a distributed assembly no-idle flow shop scheduling problem. IEEE Systems Journal, 13(2), 1945–1956.
Singla, S., Kaur, H., & Gupta, D. (2023). Optimization of Rental Cost of Machines in Two Stage No-Idle Scheduling with Transportation Time and Weightage of Jobs. 2023 10th International Conference on Computing for Sustainable Global Development (INDIACom), 818–821. https://ieeexplore.ieee.org/document/10112467
Singla, S., Kaur, H., Gupta, D., & Kaur, J. (2023a). No Idle Constraint In Flow Shop Scheduling With Transportation Time, Weightage of Jobs And Job Block Criteria. 2023 IEEE 2nd International Conference on Industrial Electronics: De-velopments & Applications (ICIDeA), 450–454. https://doi.org/10.1109/ICIDeA59866.2023.10295180
Singla, S., Kaur, H., Gupta, D., & Kaur, J. (2023b). Two Stage No Idle Flow Shop Scheduling To Minimize Rental Cost In-cluding Transportation Time. 2023 14th International Conference on Computing Communication and Networking Tech-nologies (ICCCNT), 1–4. https://doi.org/10.1109/ICCCNT56998.2023.10306808
Taillard, E. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operation-al Research , 47, 67–74.
Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278–285.
Yazdani, M., & Naderi, B. (2016). Modeling and scheduling no-idle hybrid flow shop problems. Journal of Optimization in Industrial Engineering, 10(21), 59–66.
Yoshida, T., & Hitomi, K. (1979). Optimal two-stage production scheduling with setup times separated. AIIE Transactions, 11(3), 261–263.
Zhang, W., Hou, W., Li, C., Yang, W., & Gen, M. (2021). Multidirection Update-Based Multiobjective Particle Swarm Op-timization for Mixed No-Idle Flow-Shop Scheduling Problem. Complex System Modeling and Simulation, 1(3), 176–197. https://doi.org/10.23919/CSMS.2021.0017
Zhou, Y., Chen, H., & Zhou, G. (2014). Invasive weed optimization algorithm for optimization no-idle flow shop schedul-ing problem. Neurocomputing, 137, 285–292.
Allahverdi, A., Gupta, J. N. D., & Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Omega, International Journal Management Science, 27(2), 219–239. https://doi.org/10.1016/S0305-0483(98)00042-5
Baraz, D., & Mosheiov, G. (2008). A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time. European Journal of Operational Research, 184, 810–813.
Campbell, H. G., Dudek, R. A., & Smith, M. L. (1970). A heuristic algorithm for the n job, m machine sequencing problem. Management Science, 16(10), B630–B637.
Chen, J., Wang, L., & Peng, Z. (2019). A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow-shop scheduling. Swarm and Evolutionary Computation, 50, 100557. https://doi.org/10.1016/j.swevo.2019.100557
Deng, G., & Gu, X. (2012). A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop sched-uling problem with makespan criterion. Computers and Operations Research, 39(9), 2152–2160.
Goncharov, Y., & Sevastyanov, S. (2009). The flow shop problem with noidle constraints: A review and approximation. European Journal of Operational Research, 196(2), 450–456.
Gupta, D., Goel, R., & Kaur, H. (2021). Optimizing rental cost with no idle constraints in two machines with weightage. Materials Today: Proceedings. https://doi.org/10.1016/j.matpr.2021.01.090
Gupta D., Shashi B., S. S. (2012). To Minimize The Rental Cost For 3- Stage Specially Structured Flow Shop Scheduling with Job Weightage. International Journal of Engineering Research and Applications (IJERA), 2(3), 912–916.
Ignall, E, S. L. (1965). Application of the branch and bound technique to some flow-shop scheduling problems. Operations Research, 13(3), 400–412.
Jackson, J. R. (1956). An extension of Johnson’s results on job IDT scheduling. Naval Research Logistics Quarterly, 3(3), 201–203.
Johnson, S.M. (1954). Optimal two‐and three‐stage production schedules with setup times included. Naval Research Logis-tics (NRL), 1(1), 61–68.
KALCZYNSKI, P. J., & KAMBUROWSKI, J. (2005). A heuristic for minimizing the makespan in no-idle permutation flow shops. Computers and Industrial Engineering, 49(1), 146–154.
Kim, S. C., & Bobrowski, P. M. (1994). Impact of Sequence-Dependent Setup Time on Job Shop Scheduling Performance. International Journal of Production Research, 32(7), 1503–1520.
Kumari, S., Khurana, P., & Singla, S. (2021). RAP via constraint optimization genetic algorithm. Life Cycle Reliability and Safety Engineering, 10(4), 341–345. https://doi.org/10.1007/s41872-021-00173-0
Kumari, S., Khurana, P., & Singla, S. (2022). Behavior and profit analysis of a thresher plant under steady state. Interna-tional Journal of System Assurance Engineering and Management, 13(1), 166–171. https://doi.org/10.1007/s13198-021-01183-y
Maggu, P. L., & Das, G. (1982). Weighted flow shop scheduling Problem. In Elements of Advanced Production Scheduling (1985th ed., pp. 105–111). United Publishers and Periodical distribution.
Miyazaki, S., Nishiyama, N. (1980). Analysis for minimizing weighted mean Minimizing rental cost in two stage flow shop, the processing time associated with probabilities including job block. Reflections de ERA, 1(2), 107–120.
Nawaz, M., Enscore Jr., E. E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. The International Journal of Management Science, 11(1), 91–95.
PALMER, D. S. (1985). Sequencing jobs through a multi stage process in the minimum total time-A quick method for ob-taining a near optimum. Operations Research, 16, 101–107.
Pan, Q. K., & Wang, L. (2008a). A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems. European Journal of Industrial Engineering, 2(3), 279–297.
Pan, Q. K., & Wang, L. (2008b). No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm op-timization algorithm. International Journal of Advanced Manufacturing Technonlogy., 39(7–8), 796–807.
Rad, S. F., Ruiz, R., & Boroojerdian, N. (2009). New high performing heuristics for minimizing makespan in permutation flowshops. OMEGA, the International Journal of Management Science, 37, 331–345.
RUIZ, R., & STÜTZLE, T. (2007). A simple and effective iterated greedy algorithm for the permutation flowshop schedul-ing problem. European Journal of Operational Research, 177(3), 2033–2049.
Ruiz, R., Vallada, E., & Fernández-Martínez, C. (2009). Scheduling in Flowshops with No-Idle Machines. In U. K. Chakraborty (Ed.), Computational intelligence in flow shop and job shop scheduling (Vol. 230, pp. 21–51). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-02836-6_2
Shao, W., Pi, D., & Shao, Z. (2018). Local search methods for a distributed assembly no-idle flow shop scheduling problem. IEEE Systems Journal, 13(2), 1945–1956.
Singla, S., Kaur, H., & Gupta, D. (2023). Optimization of Rental Cost of Machines in Two Stage No-Idle Scheduling with Transportation Time and Weightage of Jobs. 2023 10th International Conference on Computing for Sustainable Global Development (INDIACom), 818–821. https://ieeexplore.ieee.org/document/10112467
Singla, S., Kaur, H., Gupta, D., & Kaur, J. (2023a). No Idle Constraint In Flow Shop Scheduling With Transportation Time, Weightage of Jobs And Job Block Criteria. 2023 IEEE 2nd International Conference on Industrial Electronics: De-velopments & Applications (ICIDeA), 450–454. https://doi.org/10.1109/ICIDeA59866.2023.10295180
Singla, S., Kaur, H., Gupta, D., & Kaur, J. (2023b). Two Stage No Idle Flow Shop Scheduling To Minimize Rental Cost In-cluding Transportation Time. 2023 14th International Conference on Computing Communication and Networking Tech-nologies (ICCCNT), 1–4. https://doi.org/10.1109/ICCCNT56998.2023.10306808
Taillard, E. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operation-al Research , 47, 67–74.
Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278–285.
Yazdani, M., & Naderi, B. (2016). Modeling and scheduling no-idle hybrid flow shop problems. Journal of Optimization in Industrial Engineering, 10(21), 59–66.
Yoshida, T., & Hitomi, K. (1979). Optimal two-stage production scheduling with setup times separated. AIIE Transactions, 11(3), 261–263.
Zhang, W., Hou, W., Li, C., Yang, W., & Gen, M. (2021). Multidirection Update-Based Multiobjective Particle Swarm Op-timization for Mixed No-Idle Flow-Shop Scheduling Problem. Complex System Modeling and Simulation, 1(3), 176–197. https://doi.org/10.23919/CSMS.2021.0017
Zhou, Y., Chen, H., & Zhou, G. (2014). Invasive weed optimization algorithm for optimization no-idle flow shop schedul-ing problem. Neurocomputing, 137, 285–292.