loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Authors: Christoph Fünfzig 1 ; Roderich Wallrath 2 and Stefan Hubert 2

Affiliations: 1 CFS Software, 53894 Mechernich, Germany ; 2 Engineering & Technology, Bayer AG, 51368 Leverkusen, Germany

Keyword(s): Constraint Programming, Symmetry Breaking, Assignment Problem, Parallel-Machine Production Scheduling.

Abstract: In this article, we consider different batch assignment schemes for non-separable, non-preemptive production scheduling on m parallel work stations. Batch assignment is a very important part of production models as batches with identical parameters usually occur in a large number in real-world applications, which causes a large number of symmetric solutions. The common scheme Exactly-n for assignment of n batches to m machines originating from general assignment problems is very inefficient when it comes to scheduling, even with additional ordering for symmetry breaking (Exactly-n Ordered). We define three restricted assignment schemes for the same-parameter batches by forming blocks of size 0 ≤ zi ≤ n on machine i and ordering them between the different machines. We compute bounds for the number of feasible assignments as a measure for the feasible space and give solving times from our experiments with a boolean inference-based solver like the Google CP-SAT solver. We show that with the proposed restricted assignment schemes, production scheduling models result that solve significantly faster than the models with the common scheme Exactly-n. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.149.235.63

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Fünfzig, C.; Wallrath, R. and Hubert, S. (2024). Efficient Batch Assignment for Parallel-Machine Production Scheduling. In Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART; ISBN 978-989-758-680-4; ISSN 2184-433X, SciTePress, pages 268-274. DOI: 10.5220/0012320800003636

@conference{icaart24,
author={Christoph Fünfzig. and Roderich Wallrath. and Stefan Hubert.},
title={Efficient Batch Assignment for Parallel-Machine Production Scheduling},
booktitle={Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART},
year={2024},
pages={268-274},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012320800003636},
isbn={978-989-758-680-4},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART
TI - Efficient Batch Assignment for Parallel-Machine Production Scheduling
SN - 978-989-758-680-4
IS - 2184-433X
AU - Fünfzig, C.
AU - Wallrath, R.
AU - Hubert, S.
PY - 2024
SP - 268
EP - 274
DO - 10.5220/0012320800003636
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic