Dynamic Distributed Job-Shop Scheduling Problem Consisting of Reconfigurable Machine Tools

4Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Keeping pace with rapidly changing customer requirements forces companies to increase the capability of adaptation of their production systems. To fulfill the market requirements in a reasonable time and cost, distributed manufacturing has been emerged as one of the efficient approaches. Moreover, the ability of reconfigurability makes manufacturing systems and tools to be more adaptable. This research deals with a dynamic production scheduling problem simultaneously in several different shop-floors consisting of reconfigurable machine tools (RMTs) by utilizing the real-time data extracted from a cyber-physical system (CPS). First, a mathematical programming model is presented for the static state. Thereafter, by utilizing the CPS capabilities, a dynamic model is extended to schedule new jobs, in which there have already been some other jobs in each facility. A numerical example is solved to illustrate the validation of the model. Finally, some potential solving approaches are proposed to make the model implementable in real-world applications.

Cite

CITATION STYLE

APA

Mahmoodjanloo, M., Tavakkoli-Moghaddam, R., Baboli, A., & Bozorgi-Amiri, A. (2020). Dynamic Distributed Job-Shop Scheduling Problem Consisting of Reconfigurable Machine Tools. In IFIP Advances in Information and Communication Technology (Vol. 592 IFIP, pp. 460–468). Springer. https://doi.org/10.1007/978-3-030-57997-5_53

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free