Scheduling Multiple Batch Processing Machines with Stage Specific Incompatible Job Families

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

Abstract

We develop and evaluate several heuristics for generating a valid production plan for a multi-product multi-stage flow shop according to the MBPMSIF. The heuristics are simple and fast thus they can serve as basis methods for meta-heuristics such as genetic algorithms.

Cite

CITATION STYLE

APA

Isenberg, M. A., & Scholz-Reiter, B. (2013). Scheduling Multiple Batch Processing Machines with Stage Specific Incompatible Job Families. In Lecture Notes in Logistics (pp. 125–139). Springer Science and Business Media B.V. https://doi.org/10.1007/978-3-642-35966-8_10

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