default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Scheduling, Volume 6
Volume 6, Number 1, January-February 2003
- Kenneth R. Baker, J. Cole Smith
:
A Multiple-Criterion Model for Machine Scheduling. 7-16 - Erik Demeulemeester, Mario Vanhoucke, Willy Herroelen:
RanGen: A Random Network Generator for Activity-on-the-Node Networks. 17-38 - Guilherme Ernani Vieira, Jeffrey W. Herrmann, Edward Lin:
Rescheduling Manufacturing Systems: A Framework of Strategies, Policies, and Methods. 39-62 - Richard Freling, Dennis Huisman, Albert P. M. Wagelmans:
Models and Algorithms for Integration of Vehicle and Crew Scheduling. 63-85 - Alessandro Agnetis, Arianna Alfieri, Gaia Nicosia:
Part Batching and Scheduling in a Flexible Cell to Minimize Setup Costs. 87-108
Volume 6, Number 2, March-April 2003
- Kirk Pruhs, Bala Kalyanasundaram:
Editorial: Special Issue on On-line Scheduling. 111-112 - Ran Adler, Yossi Azar:
Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms. 113-129 - Eric Bach, Joan Boyar, Leah Epstein, Lene M. Favrholdt, Tao Jiang, Kim S. Larsen, Guo-Hui Lin, Rob van Stee:
Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem. 131-147 - Mark Brehob, Richard J. Enbody, Eric Torng, Stephen Wagner:
On-line Restricted Caching. 149-166 - Esteban Feuerstein, Marcelo Mydlarz, Leen Stougie:
On-line Multi-threaded Scheduling. 167-181 - Michael H. Goldwasser:
Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control. 183-211 - Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To:
Competitive Deadline Scheduling via Additional or Faster Processors. 213-223
Volume 6, Number 3, May-June 2003
- Kirk Pruhs, Bala Kalyanasundaram:
Editorial: Special Issue on On-Line Scheduling. 227-228 - Kirk Pruhs:
Dedication. 229 - Jeff Edmonds, Donald D. Chinn, Tim Brecht, Xiaotie Deng:
Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics. 231-250 - Ee-Chien Chang, Chee-Keng Yap:
Competitive On-Line Scheduling with Level of Service. 251-267 - Michael H. Goldwasser, Boris Kerbikov:
Admission Control with Immediate Notification. 269-285 - Sandy Irani, Vitus J. Leung:
Scheduling with Conflicts on Bipartite and Interval Graphs. 287-307 - Steven S. Seiden:
Barely Random Algorithms for Multiprocessor Scheduling. 309-334
Volume 6, Number 4, July-August
- Nicholas G. Hall, Gilbert Laporte, Esaignani Selvarajah, Chelliah Sriskandarajah:
Scheduling and Lot Streaming in Flowshops with No-Wait in Process. 339-354 - Nadia Brauner, Gerd Finke, Wieslaw Kubiak:
Complexity of One-Cycle Robotic Flow-Shops. 355-372 - Milind Dawande, Subodha Kumar, Chelliah Sriskandarajah:
Performance Bounds of Algorithms for Scheduling Advertisements on a Web Page. 373-394 - Philippe Baptiste, Baruch Schieber:
A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness. 395-404 - C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan:
Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs. 405-412 - Edward P. K. Tsang:
Constraint Based Scheduling: Applying Constraint Programming to Scheduling Problems. 413-414 - Sam R. Thangiah:
Computer-aided Scheduling of Public Transport. 415-418
Volume 6, Number 5, September - October 2003
- Sem C. Borst, Onno J. Boxma, Jan Friso Groote, Sjouke Mauw:
Task Allocation in a Multi-Server System. 423-436 - Anthony Wren, Sarah Fores, Ann S. K. Kwan, Raymond S. K. Kwan, Margaret Parker, Les G. Proll:
A Flexible System for Scheduling Drivers. 437-455 - Jörn Migge, Alain Jean-Marie, Nicolas Navet:
Timing Analysis of Compound Scheduling Policies: Application to Posix1003.1B. 457-482 - T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard. 483-490
Volume 6, Number 6, November-December 2003
- George L. Vairaktarakis:
Simple Algorithms for Gilmore-Gomory's Traveling Salesman and Related Problems. 499-520 - Monaldo Mastrolilli:
Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times. 521-531 - Francis Sourd, Safia Kedad-Sidhoum:
The One-Machine Problem with Earliness and Tardiness Penalties. 533-549 - T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs. 551-555
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 2025-11-04 00:44 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:
