More Web Proxy on the site http://driver.im/

research-article

Scheduling parallel-batching processing machines problem with learning and deterioration effect in fuzzy environment

Authors: Rui Wang, Zhaohong Jia, Kai LiAuthors Info & Claims

Journal of Intelligent & Fuzzy Systems, Volume 40, Issue 6

Pages 12111 - 12124

https://doi.org/10.3233/JIFS-210196

Published: 01 January 2021 Publication History

Abstract

In this paper, a problem of scheduling jobs with different sizes and fuzzy processing times (FPT) on non-identical parallel batch machines to minimize makespan is investigated. Moreover, the processing time (PT) of each batch is subject to the location-based learning and total-PT-based deterioration effect. Since this is an NP-hard combinatorial optimization problem, an improved intelligent algorithm based on fruit fly optimization algorithm (IFOA) is proposed. To verify the performance of the algorithm, the IFOA is compared with three state-of-the-art algorithms. The comparative results demonstrate that the proposed IFOA outperforms the other compared algorithms.

References

[1]

Ahmadi J.H., Ahmadi R.H., Dasu S. and Tang C.S., Batching and scheduling jobs on batch and discrete processors, Operations Research 40 (1992), 750–763.

Digital Library

[2]

Tang L., Zhao X., Liu J. and Leung J.Y.T., Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine, European Journal of Operational Research 263 (2017), 401–411.

[3]

Pei J., Liu X., Liao B., Pardalos P.M. and Kong M., Singlemachine scheduling with learning effect and resource-dependent processing times in the serial-batching production, Applied Mathematical Modelling 58 (2018), 245–253.

[4]

Jia Z.h., Li K. and Leung J.Y.T., Effective heuristic for makespan minimization in parallel batch machines with non-identical capacities, International Journal of Production Economics 169 (2015), 1–10.

[5]

Li S., Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan, European Journal of Operational Research 260 (2017), 12–20.

[6]

Zhou S., Xie J., Du N. and Pang Y., A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes, Applied Mathematics and Computation 334 (2018), 254–268.

Digital Library

[7]

Mokhtari H. and Noroozi A., An efficient chaotic based pso for earliness/tardiness optimization in a batch processing flow shop scheduling problem, Journal of Intelligent Manufacturing 29 (2018), 1063–1081.

Digital Library

[8]

Zheng X., Zhou S. and Chen H., Ant colony optimisation algorithms for two-stage permutation flow shop with batch processing machines and nonidentical job sizes, International Journal of Production Research 57 (2019), 3060–3079.

[9]

Matin H.N.Z., Salmasi N. and Shahvari O., Makespan minimization in flowshop batch processing problem with different batch compositions on machines, International Journal of Production Economics 193 (2017), 832–844.

[10]

Zhou S., Chen H., Xu R. and Li X., Minimising makespan on a single batch processing machine with dynamic job arrivals and non-identical job sizes, International Journal of Production Research 52 (2014), 2258–2274.

[11]

Ribas I., Companys R. and Tort-Martorell X., An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem, Expert Systems with Applications 121 (2019), 347–361.

Digital Library

[12]

Zhou S., Li X., Du N., Pang Y. and Chen H., A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost, Computers & Operations Research 96 (2018), 55–68.

[13]

Shahvari O. and Logendran R., A bi-objective batch processing problem with dual-resources on unrelated-parallel machines, Applied Soft Computing 61 (2017), 174–192.

[14]

Costa A., Hybrid genetic optimization for solving the batchscheduling problem in a pharmaceutical industry, Computers & Industrial Engineering 79 (2015), 130–147.

[15]

Chung T.P. and Sun H., Scheduling batch processing machine problem with non-identical job sizes via artificial immune system, Journal of Industrial and Production Engineering 35 (2018), 129–134.

[16]

Ni Y. and Zhao Z., Two-agent scheduling problem under fuzzy environment, Journal of Intelligent Manufacturing 28 (2017), 739–748.

Digital Library

[17]

Liao T.W. and Su P., Parallel machine scheduling in fuzzy environment with hybrid ant colony optimization including a comparison of fuzzy number ranking methods in consideration of spread of fuzziness, Applied Soft Computing 56 (2017), 65–81.

Digital Library

[18]

Geyik F. and Elibal K., A linguistic approach to non-identical parallel processor scheduling with fuzzy processing times, Applied Soft Computing 55 (2017), 63–71.

Digital Library

[19]

Cheng B., Zhu H., Li K. and Li Y., Optimization of batch operations with a truncated batch-position-based learning effect, Omega 85 (2019), 134–143.

[20]

Azzouz A., Ennigrou M. and BenSaid L., Scheduling problems under learning effects: classification and cartography, International Journal of Production Research 56 (2018), 1642–1661.

[21]

Gao Y., Yuan J., Ng C.T. and Cheng T., A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan, European Journal of Operational Research 273 (2019), 74–81.

[22]

Pei J., Liu X., Fan W., Pardalos P.M. and Lu S., A hybrid bavns algorithm for coordinated serial-batching scheduling with deteriorating jobs, financial budget, and resource constraint in multiple manufacturers, Omega 82 (2019), 55–69.

[23]

Biskup D., Single-machine scheduling with learning considerations, European Journal of Operational Research 115 (1999), 173–178.

[24]

Ji M., Tang X., Zhang X. and Cheng T.E., Machine scheduling with deteriorating jobs and dejong’s learning effect, Computers & Industrial Engineering 91 (2016), 42–47.

Digital Library

[25]

Pan W.T., A new fruit fly optimization algorithm: taking the financial distress model as an example, Knowledge-Based Systems 26 (2012), 69–74.

Digital Library

[26]

Montgomery D.C., Design and analysis of experiments, John Wiley & Sons (2017).

[27]

VahediNouri B., Fattahi P. and Ramezanian R., Hybrid fireflysimulated annealing algorithm for the flow shop problem with learning effects and flexible maintenance activities, International Journal of Production Research 51 (2013), 3501–3515.

[28]

Biswas A. and Biswas B., Analyzing evolutionary optimization and community detection algorithms using regression line dominance, Information Sciences 396 (2017), 185–201.

Digital Library

[29]

Jia Z.H., Yan J. and Leung J.Y.T., Ant colony optimization algorithm for scheduling jobs with fuzzy processing time on parallel batch machines with different capacities, Applied Soft Computing 75 (2019), 548–561.

[30]

Melouk S., Damodaran P. and Chang P.Y., Minimizing makespan for single machine batch processing with nonidentical job sizes using simulated annealing, International Journal of Production Economics 87 (2004), 141–147.

[31]

Rostami M., Pilerood A.E. and Mazdeh M.M., Multi-objective parallel machine scheduling problem with job deterioration and learning effect under fuzzy environment, Computers and Industrial Engineering 85 (2015), 206–215.

Digital Library

[32]

Wang L. and Zheng X., A knowledge-guided multi-objective fruit fly optimization algorithm for the multi-skill resource constrained project scheduling problem, Swarm and Evolutionary Computation 38 (2018), 54–63.

[33]

Zheng X. and Wang L., A two-stage adaptive fruit fly optimization algorithm for unrelated parallel machine scheduling problem with additional resource constraints, Expert Systems with Applications 65 (2016), 28–39.

Digital Library

[34]

Liu Q., Zhan M. and Chekem F.O., A hybrid fruit fly algorithm for solving flexible job-shop scheduling to reduce manufacturing carbon footprint, Journal of Cleaner Production 168 (2017), 668–678.

Cited By

Wang JTang HLei D(2024)A feedback-based artificial bee colony algorithm for energy-efficient flexible flow shop scheduling problem with batch processing machinesApplied Soft Computing10.1016/j.asoc.2024.111254153:COnline publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1016/j.asoc.2024.111254

Index Terms

Scheduling parallel-batching processing machines problem with learning and deterioration effect in fuzzy environment
1. Computing methodologies
  1. Artificial intelligence
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Scheduling algorithms
    2. Online algorithms
      1. Online learning algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

Index terms have been assigned to the content through auto-classification.

Recommendations

The Constrained Parallel-Machine Scheduling Problem with Divisible Processing Times and Penalties
Algorithmic Aspects in Information and Management
Abstract
We consider the constrained parallel-machine scheduling problem with divisible processing times and penalties (the CPS-DTP problem, for short). Specifically, given a set $M = {a_{1}, a_{2}, \dots, a_{m}}$ of m identical machines, and a set $J = {b_{1}, b_{2}, \dots, b_{n}}$ of n jobs, ... $_{}$ $_{}^{}$ $_{}^{}$ $_{}_{}$ $_{}_{}$ $_{}$ $_{}$ $_{}$ $_{}$ $_{}$ $_{}$ $_{}$
Scheduling jobs under decreasing linear deterioration

This paper considers the scheduling problems under decreasing linear deterioration. Deterioration of a job means that its processing time is a function of its execution start time. Optimal algorithms are presented respectively for single machine ...
Scheduling jobs with release dates on parallel batch processing machines

In this paper we consider the problem of scheduling jobs with release dates on parallel unbounded batch processing machines to minimize the maximum lateness. We show that the case where the jobs have deadlines is strongly NP-hard. We develop a ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology

Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology Volume 40, Issue 6

2021

2124 pages

ISSN:1064-1246

Issue’s Table of Contents

© 2021 – IOS Press. All rights reserved.

Publisher

IOS Press

Netherlands

Publication History

Published: 01 January 2021

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 20 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wang JTang HLei D(2024)A feedback-based artificial bee colony algorithm for energy-efficient flexible flow shop scheduling problem with batch processing machinesApplied Soft Computing10.1016/j.asoc.2024.111254153:COnline publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1016/j.asoc.2024.111254

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents