The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
Year of publication: |
2008
|
---|---|
Authors: | Nong, Q. Q. ; Ng, C. T. ; Cheng, T. C. E. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 36.2008, 1, p. 61-66
|
Subject: | Scheduling-Verfahren | Scheduling problem | Heimarbeit | Home-based work | Operations Research | Operations research |
-
Scheduling flow shops with blocking using a discrete self-organising migrating algorithm
Davendra, Donald, (2013)
-
New models and applications for railway timetabling
Polinder, Gert-Jaap, (2020)
-
On integrating patient appointment grids and technologist schedules in a radiology center
Bentayeb, Dina, (2023)
- More ...
-
An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
Nong, Q. Q., (2008)
-
Two-agent scheduling to minimize the total cost
Nong, Q. Q., (2011)
-
Bicriterion scheduling with equal processing times on a batch processing machine
Liu, L. L., (2009)
- More ...