Auction-based approach to the job-shop problem with parallel batch processing and a machine availability constraint

References

• Abedi, M., H. Seidgar, H. Fazlollahtabar, and R. Bijani. 2015. “Bi-objective Optimization for Scheduling the Identical Parallel Batch-Processing Machines with Arbitrary Job Sizes, Unequal Job Release Times and Capacity Limits.” International Journal of Production Research 53 (6): 1680–1711.
   Web of Science ®Google Scholar
• Adhau, S., M. L. Mittal, and A. Mittal. 2012. “A Multi-agent System for Distributed Multi-project Scheduling: An Auction-Based Negotiation Approach.” Engineering Applications of Artificial Intelligence 25 (8): 1738–1751.
   Web of Science ®Google Scholar
• Arroyo, J. E. C., J. Y. T. Leung, and R. Goncalves Tavares. 2019. “An Iterated Greedy Algorithm for Total Flow Time Minimization in Unrelated Parallel Batch Machines with Unequal Job Release Times.” Engineering Applications of Artificial Intelligence 77: 239–254.
   Web of Science ®Google Scholar
• Chung, T. P., J. N. D. Gupta, and M. Qiu. 2019. “Single Machine Scheduling Problem with Batch Setups Involving Positional Deterioration Effects and Multiple Rate-Modifying Activities.” Engineering Optimization 51 (10): 1743–1760.
   Web of Science ®Google Scholar
• Chung, T.-P., C.-J. Liao, and C.-H. Lin. 2012. “Minimizing Make-Span on Parallel Machines with Batch Arrivals.” Engineering Optimization 44 (4): 467–476.
   Web of Science ®Google Scholar
• Fatima, E. K., B. Jaouad, and E. H. A. Ahmed. 2017. “The “Dual-Ants Colony”: A Novel Hybrid Approach for the Flexible Job Shop Scheduling Problem with Preventive Maintenance.” Computers & Industrial Engineering 106: 236–255.
   Web of Science ®Google Scholar
• Ham, A. 2017. “Flexible Job Shop Scheduling Problem for Parallel Batch Processing Machine with Compatible Job Families.” Applied Mathematical Modelling 45: 551–562.
   Web of Science ®Google Scholar
• Ham, A. M., and E. Cakici. 2016. “Flexible Job Shop Scheduling Problem with Parallel Batch Processing Machines: MIP and CP Approaches.” Computers & Industrial Engineering 102: 160–165.
   Web of Science ®Google Scholar
• Huang, J. D., J. J. Liu, Q. X. Chen, and N. Mao. 2017. “Minimizing Makespan in a Two-Stage Flow Shop with Parallel Batch-Processing Machines and Re-entrant Jobs.” Engineering Optimization 49 (6): 1010–1023.
   Web of Science ®Google Scholar
• Hulett, M., P. Damodaran, and M. Amouie. 2017. “Scheduling Non-identical Parallel Batch Processing Machines to Minimize Total Weighted Tardiness Using Particle Swarm Optimization.” Computers & Industrial Engineering 113: 425–436.
   Web of Science ®Google Scholar
• Lawrence, S. 1984. Supplement to Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques, GSIA. Pittsburgh, PA: Carnegie Mellon University.
   Google Scholar
• Li, D. N., X. W. Meng, M. Li, and Y. N. Tian. 2016. “An ACO-Based Intercell Scheduling Approach for Job Shop Cells with Multiple Single Processing Machines and One Batch Processing Machine.” Journal of Intelligent Manufacturing 27 (2): 283–296.
   Web of Science ®Google Scholar
• Majumder, A., D. Laha, and P. N. Suganthan. 2018. “A Hybrid Cuckoo Search Algorithm in Parallel Batch Processing Machines with Unequal Job Ready Times.” Computers & Industrial Engineering 124: 65–76.
   Web of Science ®Google Scholar
• Moradi, E., S. M. T. Fatemi Ghomi, and M. Zandieh. 2011. “Bi-objective Optimization Research on Integrated Fixed Time Interval Preventive Maintenance and Production for Scheduling Flexible Job-Shop Problem.” Expert Systems with Applications 38 (6): 7169–7178.
   Web of Science ®Google Scholar
• Pei, J., X. B. Liu, W. J. Fan, P. M. Pardalos, and S. J. Lu. 2019. “A Hybrid BA-VNS Algorithm for Coordinated Serial-Batching Scheduling with Deteriorating Jobs, Financial Budget, and Resource Constraint in Multiple Manufacturers.” Omega 82: 55–69.
   Web of Science ®Google Scholar
• Pei, J., J. L. Wei, B. Y. Liao, X. B. Liu, and P. M. Pardalos. 2020. “Two-Agent Scheduling on Bounded Parallel-Batching Machines with an Aging Effect of Job-Position-Dependent.” Annals of Operations Research 294: 191–223.
   Web of Science ®Google Scholar
• Rajkumar, M., P. Asokan, and V. Vamsikrishna. 2010. “A GRASP Algorithm for Flexible Job-Shop Scheduling with Maintenance Constraints.” International Journal of Production Research 48 (22): 6821–6836.
   Web of Science ®Google Scholar
• Siwamogsatham, T., and C. Saygin. 2004. “Auction-Based Distributed Scheduling and Control Scheme for Flexible Manufacturing Systems.” International Journal of Production Research 42 (3): 547–572.
   Web of Science ®Google Scholar
• Storer, R. H., S. D. Wu, and R. Vaccari. 1992. “New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling.” Management Science 38 (10): 1495–1509.
   Web of Science ®Google Scholar
• Tang, J. F., C. K. Zeng, and Z. D. Pan. 2016. “Auction-Based Cooperation Mechanism to Parts Scheduling for Flexible Job Shop with Inter-cells.” Applied Soft Computing 49: 590–602.
   Web of Science ®Google Scholar
• Wang, H.-M., and F.-D. Chou. 2010. “Solving the Parallel Batch-Processing Machines with Different Release Times, Job Size, and Capacity Limits by Metaheuristics.” Expert Systems with Applications 37 (2): 1510–1521.
   Web of Science ®Google Scholar
• Wang, S. J., and J. B. Yu. 2010. “An Effective Heuristic for Flexible Job-Shop Scheduling Problem with Maintenance Activities.” Computers and Industrial Engineering 59 (3): 436–447.
   Web of Science ®Google Scholar
• Zandieh, M., A. R. Khatamib, and S. H. A. Rahmati. 2017. “Flexible Job Shop Scheduling Under Condition-Based Maintenance: Improved Version of Imperialist Competitive Algorithm.” Applied Soft Computing 58: 449–464.
   Web of Science ®Google Scholar
• Zeng, C. K., J. F. Tang, and Z.-P. Fan. 2019. “Auction-Based Cooperation Mechanism for Cell Part Scheduling with Transportation Capacity Constraint.” International Journal of Production Research 57 (12): 3831–3846.
   Web of Science ®Google Scholar
• Zeng, C. K., J. F. Tang, Z.-P. Fan, and C. J. Yan. 2019. “Auction-Based Approach for a Flexible Job Shop Scheduling Problem with Multiple Process Plans.” Engineering Optimization 51 (11): 1902–1919.
   Web of Science ®Google Scholar
• Zeng, C. K., J. F. Tang, Z.-P. Fan, and C. J. Yan. 2020. “Scheduling of a Job-Shop Problem with Limited Output Buffers.” Engineering Optimization 52 (1): 53–73.
   Web of Science ®Google Scholar
• Zeng, C. K., J. F. Tang, Z.-P. Fan, and C. J. Yan. Forthcoming. “Bid Construction Scheme Based on Local Search to Solve Serial–Parallel Cooperative Batch Scheduling Problems.” Engineering Optimization.
   Web of Science ®Google Scholar
• Zeng, C. K., J. F. Tang, and C. J. Yan. 2014. “Scheduling of No Buffer Job Shop Cells with Blocking Constraints and Automated Guided Vehicles.” Applied Soft Computing 24: 1033–1046.
   Web of Science ®Google Scholar
• Zeng, C. K., J. F. Tang, and C. J. Yan. 2015. “Job-Shop Cell-Scheduling Problem with Inter-cell Moves and Automated Guided Vehicles.” Journal of Intelligent Manufacturing 26 (5): 845–859.
   Web of Science ®Google Scholar
• Zhao, H. J., S. Y. Huo, K. Li, and H. P. Chen. 2020. “Integrated Scheduling on Parallel Batch Processing Machines with Non-identical Capacities.” Engineering Optimization 52 (4): 715–730.
   Web of Science ®Google Scholar
• Zhou, X. J., Z. Q. Lu, and L. F. Xi. 2012. “Preventive Maintenance Optimization for a Multi-component System Under Changing Job Shop Schedule.” Reliability Engineering and System Safety 101: 14–20.
   Web of Science ®Google Scholar