Research Article
A heuristic approach to allocating the continuous resource in discrete–continuous scheduling problems to minimize the makespan
Article first published online: 7 NOV 2002
DOI: 10.1002/jos.119
Copyright © 2002 John Wiley & Sons, Ltd.
Issue
1099-1425/asset/cover.gif?v=1&s=713a24f62f0b2a40d4934d3c654feda368b1d6fd "Journal of Scheduling")
Journal of Scheduling
Special Issue: Special Issue of Selected Papers from the Dagstuhl Workshop on Scheduling in Computer and Manufacturing Systems
Volume 5, Issue 6, pages 487–499, November/December 2002
Additional Information
How to Cite
Józefowska, J., Mika, M., Różycki, R., Waligóra, G. and Węglarz, J. (2002), A heuristic approach to allocating the continuous resource in discrete–continuous scheduling problems to minimize the makespan. J. Sched., 5: 487–499. doi: 10.1002/jos.119
Publication History
- Issue published online: 7 NOV 2002
- Article first published online: 7 NOV 2002
Funded by
- State Committee for Scientific Research, Poland. Grant Number: 8T11A 02016
Options for accessing this content:
- If you have access to this content through a society membership, please first log in to your society website.
- If you would like institutional access to this content, please recommend the title to your librarian.
- Login via Athens http://onlinelibrary.wiley.com/athens or other institutional login options http://onlinelibrary.wiley.com/login-options .
- You can purchase online access to this Article for a 24-hour period (price varies by title)
- If you already have a Wiley Online Library or Wiley InterScience user account: login above and proceed to purchase the article.
- New Users: Please register, then proceed to purchase the article.
Registered Users please login:
- Access your saved publications, articles and searches
- Manage your email alerts, orders and subscriptions
- Change your contact information, including your password
Please register to:
- Save publications, articles and searches
- Get email alerts
- Get all the benefits mentioned below!