The Distributed No-Idle Flowshop Scheduling Problem with Due Windows Dataset

Published: 5 April 2023| Version 1 | DOI: 10.17632/yr5tyyk8ds.1
Contributors:
Kasra Mousighichi,
,

Description

"The Distributed No-Idle Flowshop Scheduling Problem with Due Windows (DNIFSPDW)" addresses an extension of the Distributed Permutation Flowshop Scheduling Problem with No-Idle and Due Window constraints. The objective of DNIFSPDW is to determine the optimal sequence of job assignments to factories and the sequence in which they should be performed in each factory. This optimal sequence should ensure the minimum total weighted earliness and tardiness (TWET) penalties while also taking into account the due windows. The enclosed document comprises three distinct files: Small, Large, and Readme. Within the Small and Large files, you will find the data that was developed and utilized for assessing the problem of distributed no-idle flowshop scheduling with due windows. The Readme file provides a comprehensive account of the contents of both the Small and Large files, including a detailed description of the data that is contained within them.

Files

Institutions

Dokuz Eylul Universitesi Fen Bilimleri Enstitusu

Categories

Flowshop Scheduling

License