Multiple-model description and generalised algorithm of ship-building wharf scheduling
by Boris Sokolov; Vyacheslav Zelentsov; Semyon Potryasaev; Vladimir Kalinin; Oleg Tolpegin
International Journal of Service and Computing Oriented Manufacturing (IJSCOM), Vol. 3, No. 4, 2018

Abstract: We present a new multiple-model description and generalised algorithm of ship-building wharf scheduling. This description is represented as a special case of the job-shop-scheduling problem with dynamically distributed jobs, resources, flows, structures. The approach is based on a natural dynamic decomposition of the problem and its solution with the help of a modified form of continuous maximum principle coupled with combinatorial optimisation.

Online publication date: Mon, 06-May-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Service and Computing Oriented Manufacturing (IJSCOM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com