[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Logic in Computer Science

arXiv:2208.03100 (cs)
[Submitted on 5 Aug 2022]

Title:Decomposition Strategies for Solving Scheduling Problems in Industrial Applications

Authors:Mohammed M. S. El-Kholany (University of Klagenfurt, Klagenfurt, Austria)
View PDF
Abstract:This article presents an overview of a research study of a crucial optimization problem in the Computer Science/Operations research field: The Job-shop Scheduling Problem (JSP). The JSP is a challenging task in which a set of operations must be processed using a set of scarce machines to optimize a particular objective. The main purpose of the JSP is to determine the execution order of the processes assigned to each machine to optimize an objective. Our main interest in this study is to investigate developing decomposition strategies using logic programming to solve the JSP. We split our goal into two main phases. The first phase is to apply the decomposition approach and evaluate the proposed model by solving a set of known benchmark instances. The second phase is to apply the successful decomposition methods obtained from the first phase to solve a scheduling problem in the real-life application. In the current state, we finished the first phase and started the second one aiming to have a model that can provide a schedule of a factory for a short-time period.
Comments: In Proceedings ICLP 2022, arXiv:2208.02685
Subjects: Logic in Computer Science (cs.LO)
Cite as: arXiv:2208.03100 [cs.LO]
  (or arXiv:2208.03100v1 [cs.LO] for this version)
  https://doi.org/10.48550/arXiv.2208.03100
Journal reference: EPTCS 364, 2022, pp. 236-242
Related DOI: https://doi.org/10.4204/EPTCS.364.39

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Fri, 5 Aug 2022 10:51:20 UTC (12 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.LO
< prev   |   next >
new | recent | 2022-08
Change to browse by:
cs

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)