Solving job-shop scheduling problems with fuzzy processing times and fuzzy due dates

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

Abstract

This paper shows an iterative method for solving n-jobs, m-machines scheduling problems with fuzzy processing times and fuzzy due dates which are defined using third-party information coming from experts. We use an iterative method based on the cumulative membership function of a fuzzy set to find an overall satisfaction degree among fuzzy processing times and fuzzy due dates.

Cite

CITATION STYLE

APA

Bustos-Tellez, C. A., Tenjo-García, J. S., & Figueroa-García, J. C. (2018). Solving job-shop scheduling problems with fuzzy processing times and fuzzy due dates. In Communications in Computer and Information Science (Vol. 853, pp. 790–799). Springer Verlag. https://doi.org/10.1007/978-3-319-91473-2_66

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