Using real-time information to reschedule jobs in a flowshop with variable processing times. (March 2019)

• Record Type: Journal Article
• Authors: Framinan, Jose M.; Fernandez-Viagas, Victor; Perez-Gonzalez, Paz
• Is Part Of: Computers & industrial engineering. Volume 129(2019)
• Page Start: 113
• Page End: 125
• Publication Date: 2019-03
• Subjects: Rescheduling -- Flowshop -- Industry 4.0 -- Variable processing times -- Critical path; Engineering -- Data processing -- Periodicals; Industrial engineering -- Periodicals; 620.00285
• DOI: 10.1016/j.cie.2019.01.036
• Languages: English
• ISSNs: 0360-8352

Abstract

Highlights: Rescheduling in a flowshop with variable processing times is studied. Different rescheduling policies specific for the problem are proposed. It is shown that rescheduling pays off under moderate or medium variability. A critical path based rescheduling policy outperforms continuous rescheduling. Abstract: In a time where detailed, instantaneous and accurate information on shop-floor status is becoming available in many manufacturing companies due to Information Technologies initiatives such as Smart Factory or Industry 4.0, a question arises regarding when and how this data can be used to improve scheduling decisions. While it is acknowledged that a continuous rescheduling based on the updated information may be beneficial as it serves to adapt the schedule to unplanned events, this rather general intuition has not been supported by a thorough experimentation, particularly for multi-stage manufacturing systems where such continuous rescheduling may introduce a high degree of nervousness in the system and deteriorates its performance. In order to study this research problem, in this paper we investigate how real-time information on the completion times of the jobs in a flowshop with variable processing times can be used to reschedule the jobs. In an exhaustive computational experience, we show that rescheduling policies pay off as long as the variability of the processing times is not very high, and only if the initially generated schedule is of good quality. Furthermore, we propose several rescheduling policies to improve the performance of continuous rescheduling while greatly reducing the frequency of rescheduling. One of these policies, based on the concept of critical path of a flowshop, outperforms the rest of policies for a wide range of scenarios.