batch scheduling on two-machine flowshop with machine-dependent setup times

Clicks: 144
ID: 247561
2009
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Star

Ranked #24 of 27 articles by views in International journal of dentistry

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
We study a batch scheduling problem on a 2-machine flowshop. We assume unit processing time jobs, batch availability, and machine-dependent setup times. The objective is to find a job allocation to batches of integer size and a batch schedule that minimize makespan. We introduce a very efficient closed form solution for the problem.
Reference Key
ben-dati2009advancesbatch Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Lika Ben-Dati;Gur Mosheiov;Daniel Oron
Journal International journal of dentistry
Year 2009
DOI
10.1155/2009/153910
URL
http://dx.doi.org/10.1155/2009/153910
Keywords
operations management production management

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.