default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 70
Volume 70, 1997
- Chung-Yee Lee, Lei Lei:
Preface. 0 - Chung-Yee Lee, Lei Lei, Michael L. Pinedo:
Current trends in deterministic scheduling. 1-41 - Lucio Bianco, Jacek Blazewicz, Paolo Dell'Olmo, Maciej Drozdowski:
Preemptive multiprocessor task scheduling with release times and time windows. 43-55 - Peter Brucker, Bernd Jurisch, Andreas Krämer:
Complexity of scheduling problems with multi-purpose machines. 57-73 - A. M. A. Hariri, Chris N. Potts:
Single machine scheduling with batch set-up times to minimize maximum lateness. 75-92 - Ali Tamer Ünal, Reha Uzsoy, Ali S. Kiran:
Rescheduling on a single machine with part-type dependent setup times and deadlines. 93-113 - Suresh Chand, Rodney Traub, Reha Uzsoy:
Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates. 115-125 - Jatinder N. D. Gupta, Johnny C. Ho, Jack A. A. van der Veen:
Single machine hierarchical scheduling with customer orders and multiple job classes. 127-143 - Surya Danusaputro Liman, Shrikant S. Panwalkar, Sansern Thongmee:
A single machine scheduling problem with common due window and controllable processing times. 145-154 - In-Chan Choi, Osman Korkmaz:
Job shop scheduling with separable sequence-dependent setups. 155-170 - Guandong Liu, Peter B. Luh, Richard Resch:
Scheduling permutation flow shops using the Lagrangian relaxation technique. 171-189 - Izak Duenyas, John J. Neale:
Stochastic scheduling of a batch processing machine with incompatible job families. 191-220 - Paul M. Stanfield, Russell E. King, Thom J. Hodgson:
Multi-objective stochastic scheduling of job ready times. 221-239 - Xiaoqiang Cai, S. Zhou:
Sequencing jobs with random processing times to minimize weighted completion time variance. 241-260 - H. A. J. Crauwels, Chris N. Potts, Luk N. Van Wassenhove:
Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time. 261-279 - Stéphane Dauzère-Pérès, Jan Paulli:
An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. 281-306 - Kedar S. Naphade, S. David Wu, Robert H. Storer:
Problem space search algorithms for resource-constrained project scheduling. 307-326 - Cheng-Chung Cheng, Stephen F. Smith:
Applying constraint satisfaction techniques to job shop scheduling. 327-357 - Michael L. Pinedo, Benjamin P.-C. Yen:
On the design and development of object-oriented scheduling systems. 359-378 - Yow-yuh Leu, Philip Y. Huang, Roberta S. Russell:
Using beam search techniques for sequencing mixed-model assembly lines. 379-397 - Nicholas G. Hall, Marc E. Posner, Chris N. Potts:
Preemptive scheduling with finite capacity input buffers. 399-413 - Alessandro Agnetis:
No-wait flow shop scheduling with large lot sizes. 415-438 - Richard L. Daniels, Barbara J. Hoopes, Joseph B. Mazzola:
An analysis of heuristics for the parallel-machine flexible-resource scheduling problem. 439-472 - Hamilton Emmons, Du-Shean Fuh:
Sizing and scheduling a full-time and part-time workforce with off-day and off-weekend constraints. 473-492
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-26 00:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
