dc.creator | Framiñán Torres, José Manuel | es |
dc.creator | Leisten, Rainer | es |
dc.date.accessioned | 2020-07-10T19:48:06Z | |
dc.date.available | 2020-07-10T19:48:06Z | |
dc.date.issued | 2019-12 | |
dc.identifier.citation | Framiñán Torres, J.M. y Leisten, R. (2019). Linking Scheduling Criteria to Shop Floor Performance in Permutation Flowshops. Algorithms, 12 (12), Article number 263. | |
dc.identifier.issn | EISSN 1999-4893 | es |
dc.identifier.uri | https://hdl.handle.net/11441/99218 | |
dc.description.abstract | The goal of manufacturing scheduling is to allocate a set of jobs to the machines in the
shop so these jobs are processed according to a given criterion (or set of criteria). Such criteria are
based on properties of the jobs to be scheduled (e.g., their completion times, due dates); so it is not
clear how these (short-term) criteria impact on (long-term) shop floor performance measures. In this
paper, we analyse the connection between the usual scheduling criteria employed as objectives
in flowshop scheduling (e.g., makespan or idle time), and customary shop floor performance
measures (e.g., work-in-process and throughput). Two of these linkages can be theoretically predicted
(i.e., makespan and throughput as well as completion time and average cycle time), and the other
such relationships should be discovered on a numerical/empirical basis. In order to do so, we
set up an experimental analysis consisting in finding optimal (or good) schedules under several
scheduling criteria, and then computing how these schedules perform in terms of the different shop
floor performance measures for several instance sizes and for different structures of processing
times. Results indicate that makespan only performs well with respect to throughput, and that one
formulation of idle times obtains nearly as good results as makespan, while outperforming it in terms
of average cycle time and work in process. Similarly, minimisation of completion time seems to be
quite balanced in terms of shop floor performance, although it does not aim exactly at work-in-process
minimisation, as some literature suggests. Finally, the experiments show that some of the existing
scheduling criteria are poorly related to the shop floor performance measures under consideration.
These results may help to better understand the impact of scheduling on flowshop performance,
so scheduling research may be more geared towards shop floor performance, which is sometimes
suggested as a cause for the lack of applicability of some scheduling models in manufacturing. | es |
dc.format | application/pdf | es |
dc.format.extent | 21 p. | es |
dc.language.iso | eng | es |
dc.publisher | MDPI | es |
dc.relation.ispartof | Algorithms, 12 (12), Article number 263. | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Scheduling | es |
dc.subject | Shop floor performance | es |
dc.subject | Flowshop | es |
dc.subject | Manufacturing | es |
dc.title | Linking Scheduling Criteria to Shop Floor Performance in Permutation Flowshops | es |
dc.type | info:eu-repo/semantics/article | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/publishedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Organización Industrial y Gestión de Empresas I | es |
dc.relation.publisherversion | https://doi.org/10.3390/a12120263 | es |
dc.identifier.doi | 10.3390/a12120263 | es |
dc.journaltitle | Algorithms | es |
dc.publication.volumen | 12 | es |
dc.publication.issue | 12 | es |
dc.publication.initialPage | Article number 263 | es |