Solving sequencing problems in spreadsheets
by Kenneth R. Baker
International Journal of Planning and Scheduling (IJPS), Vol. 1, No. 1/2, 2011

Abstract: Suppose that we wish to solve such sequencing problems as the flow shop scheduling problem or the travelling salesperson problem. We may wish to explore the use of state-of-the-art algorithms, but a more accessible alternative may exist. This paper reports computational experiments that shed light on how large a problem we might be able to solve, assuming that our work is done using a spreadsheet-based approach with the hardware and software available to today's students and practitioners: a laptop and Risk Solver Platform (RSP). The results include both optimal and heuristic solutions generated by the software.

Online publication date: Sat, 31-Dec-2011

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 Planning and Scheduling (IJPS):
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