![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/scheduling/scheduling6.bht:"
@article{DBLP:journals/scheduling/AdlerA03, author = {Ran Adler and Yossi Azar}, title = {Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms}, journal = {J. Sched.}, volume = {6}, number = {2}, pages = {113--129}, year = {2003}, url = {https://doi.org/10.1023/A:1022933824889}, doi = {10.1023/A:1022933824889}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/AdlerA03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/AgnetisAN03, author = {Alessandro Agnetis and Arianna Alfieri and Gaia Nicosia}, title = {Part Batching and Scheduling in a Flexible Cell to Minimize Setup Costs}, journal = {J. Sched.}, volume = {6}, number = {1}, pages = {87--108}, year = {2003}, url = {https://doi.org/10.1023/A:1022239620866}, doi = {10.1023/A:1022239620866}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/AgnetisAN03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/BachBEFJLLS03, author = {Eric Bach and Joan Boyar and Leah Epstein and Lene M. Favrholdt and Tao Jiang and Kim S. Larsen and Guo{-}Hui Lin and Rob van Stee}, title = {Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem}, journal = {J. Sched.}, volume = {6}, number = {2}, pages = {131--147}, year = {2003}, url = {https://doi.org/10.1023/A:1022985808959}, doi = {10.1023/A:1022985808959}, timestamp = {Wed, 01 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/scheduling/BachBEFJLLS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/BakerS03, author = {Kenneth R. Baker and J. Cole Smith}, title = {A Multiple-Criterion Model for Machine Scheduling}, journal = {J. Sched.}, volume = {6}, number = {1}, pages = {7--16}, year = {2003}, url = {https://doi.org/10.1023/A:1022231419049}, doi = {10.1023/A:1022231419049}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/BakerS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/BaptisteS03, author = {Philippe Baptiste and Baruch Schieber}, title = {A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness}, journal = {J. Sched.}, volume = {6}, number = {4}, pages = {395--404}, year = {2003}, url = {https://doi.org/10.1023/A:1024012811536}, doi = {10.1023/A:1024012811536}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/BaptisteS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/BorstBGM03, author = {Sem C. Borst and Onno J. Boxma and Jan Friso Groote and Sjouke Mauw}, title = {Task Allocation in a Multi-Server System}, journal = {J. Sched.}, volume = {6}, number = {5}, pages = {423--436}, year = {2003}, url = {https://doi.org/10.1023/A:1024840405535}, doi = {10.1023/A:1024840405535}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/BorstBGM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/BraunerFK03, author = {Nadia Brauner and Gerd Finke and Wieslaw Kubiak}, title = {Complexity of One-Cycle Robotic Flow-Shops}, journal = {J. Sched.}, volume = {6}, number = {4}, pages = {355--372}, year = {2003}, url = {https://doi.org/10.1023/A:1024008726557}, doi = {10.1023/A:1024008726557}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/BraunerFK03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/BrehobETW03, author = {Mark Brehob and Richard J. Enbody and Eric Torng and Stephen Wagner}, title = {On-line Restricted Caching}, journal = {J. Sched.}, volume = {6}, number = {2}, pages = {149--166}, year = {2003}, url = {https://doi.org/10.1023/A:1022989909868}, doi = {10.1023/A:1022989909868}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/BrehobETW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/ChangY03, author = {Ee{-}Chien Chang and Chee{-}Keng Yap}, title = {Competitive On-Line Scheduling with Level of Service}, journal = {J. Sched.}, volume = {6}, number = {3}, pages = {251--267}, year = {2003}, url = {https://doi.org/10.1023/A:1022904408360}, doi = {10.1023/A:1022904408360}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/scheduling/ChangY03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/ChengNY03, author = {T. C. Edwin Cheng and C. T. Ng and Jinjiang Yuan}, title = {The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard}, journal = {J. Sched.}, volume = {6}, number = {5}, pages = {483--490}, year = {2003}, url = {https://doi.org/10.1023/A:1024858623282}, doi = {10.1023/A:1024858623282}, timestamp = {Fri, 19 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/scheduling/ChengNY03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/ChengNY03a, author = {T. C. Edwin Cheng and C. T. Ng and Jinjiang Yuan}, title = {A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs}, journal = {J. Sched.}, volume = {6}, number = {6}, pages = {551--555}, year = {2003}, url = {https://doi.org/10.1023/A:1026276627133}, doi = {10.1023/A:1026276627133}, timestamp = {Fri, 19 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/scheduling/ChengNY03a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/DawandeKS03, author = {Milind Dawande and Subodha Kumar and Chelliah Sriskandarajah}, title = {Performance Bounds of Algorithms for Scheduling Advertisements on a Web Page}, journal = {J. Sched.}, volume = {6}, number = {4}, pages = {373--394}, year = {2003}, url = {https://doi.org/10.1023/A:1024060710627}, doi = {10.1023/A:1024060710627}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/DawandeKS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/DemeulemeesterVH03, author = {Erik Demeulemeester and Mario Vanhoucke and Willy Herroelen}, title = {RanGen: {A} Random Network Generator for Activity-on-the-Node Networks}, journal = {J. Sched.}, volume = {6}, number = {1}, pages = {17--38}, year = {2003}, url = {https://doi.org/10.1023/A:1022283403119}, doi = {10.1023/A:1022283403119}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/DemeulemeesterVH03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/EdmondsCBD03, author = {Jeff Edmonds and Donald D. Chinn and Tim Brecht and Xiaotie Deng}, title = {Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics}, journal = {J. Sched.}, volume = {6}, number = {3}, pages = {231--250}, year = {2003}, url = {https://doi.org/10.1023/A:1022952324290}, doi = {10.1023/A:1022952324290}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/EdmondsCBD03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/FeuersteinMS03, author = {Esteban Feuerstein and Marcelo Mydlarz and Leen Stougie}, title = {On-line Multi-threaded Scheduling}, journal = {J. Sched.}, volume = {6}, number = {2}, pages = {167--181}, year = {2003}, url = {https://doi.org/10.1023/A:1022987804726}, doi = {10.1023/A:1022987804726}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/FeuersteinMS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/FrelingHW03, author = {Richard Freling and Dennis Huisman and Albert P. M. Wagelmans}, title = {Models and Algorithms for Integration of Vehicle and Crew Scheduling}, journal = {J. Sched.}, volume = {6}, number = {1}, pages = {63--85}, year = {2003}, url = {https://doi.org/10.1023/A:1022287504028}, doi = {10.1023/A:1022287504028}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/FrelingHW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/Goldwasser03, author = {Michael H. Goldwasser}, title = {Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control}, journal = {J. Sched.}, volume = {6}, number = {2}, pages = {183--211}, year = {2003}, url = {https://doi.org/10.1023/A:1022994010777}, doi = {10.1023/A:1022994010777}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/Goldwasser03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/GoldwasserK03, author = {Michael H. Goldwasser and Boris Kerbikov}, title = {Admission Control with Immediate Notification}, journal = {J. Sched.}, volume = {6}, number = {3}, pages = {269--285}, year = {2003}, url = {https://doi.org/10.1023/A:1022956425198}, doi = {10.1023/A:1022956425198}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/GoldwasserK03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/HallLSS03, author = {Nicholas G. Hall and Gilbert Laporte and Esaignani Selvarajah and Chelliah Sriskandarajah}, title = {Scheduling and Lot Streaming in Flowshops with No-Wait in Process}, journal = {J. Sched.}, volume = {6}, number = {4}, pages = {339--354}, year = {2003}, url = {https://doi.org/10.1023/A:1024042209719}, doi = {10.1023/A:1024042209719}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/HallLSS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/IraniL03, author = {Sandy Irani and Vitus J. Leung}, title = {Scheduling with Conflicts on Bipartite and Interval Graphs}, journal = {J. Sched.}, volume = {6}, number = {3}, pages = {287--307}, year = {2003}, url = {https://doi.org/10.1023/A:1022908509269}, doi = {10.1023/A:1022908509269}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/IraniL03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/KooLNT03, author = {Chiu{-}Yuen Koo and Tak Wah Lam and Tsuen{-}Wan Ngan and Kar{-}Keung To}, title = {Competitive Deadline Scheduling via Additional or Faster Processors}, journal = {J. Sched.}, volume = {6}, number = {2}, pages = {213--223}, year = {2003}, url = {https://doi.org/10.1023/A:1022998111685}, doi = {10.1023/A:1022998111685}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/KooLNT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/Mastrolilli03, author = {Monaldo Mastrolilli}, title = {Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times}, journal = {J. Sched.}, volume = {6}, number = {6}, pages = {521--531}, year = {2003}, url = {https://doi.org/10.1023/A:1026272526225}, doi = {10.1023/A:1026272526225}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/scheduling/Mastrolilli03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/MiggeJN03, author = {J{\"{o}}rn Migge and Alain Jean{-}Marie and Nicolas Navet}, title = {Timing Analysis of Compound Scheduling Policies: Application to Posix1003.1B}, journal = {J. Sched.}, volume = {6}, number = {5}, pages = {457--482}, year = {2003}, url = {https://doi.org/10.1023/A:1024806606443}, doi = {10.1023/A:1024806606443}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/MiggeJN03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/NgCY03, author = {C. T. Ng and T. C. Edwin Cheng and Jinjiang Yuan}, title = {Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs}, journal = {J. Sched.}, volume = {6}, number = {4}, pages = {405--412}, year = {2003}, url = {https://doi.org/10.1023/A:1024284828374}, doi = {10.1023/A:1024284828374}, timestamp = {Fri, 19 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/scheduling/NgCY03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/Pruhs03, author = {Kirk Pruhs}, title = {Dedication}, journal = {J. Sched.}, volume = {6}, number = {3}, pages = {229}, year = {2003}, url = {https://doi.org/10.1023/A:1022900307452}, doi = {10.1023/A:1022900307452}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/Pruhs03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/PruhsK03, author = {Kirk Pruhs and Bala Kalyanasundaram}, title = {Editorial: Special Issue on On-line Scheduling}, journal = {J. Sched.}, volume = {6}, number = {2}, pages = {111--112}, year = {2003}, url = {https://doi.org/10.1023/A:1022929708051}, doi = {10.1023/A:1022929708051}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/PruhsK03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/PruhsK03a, author = {Kirk Pruhs and Bala Kalyanasundaram}, title = {Editorial: Special Issue on On-Line Scheduling}, journal = {J. Sched.}, volume = {6}, number = {3}, pages = {227--228}, year = {2003}, url = {https://doi.org/10.1023/A:1022992023381}, doi = {10.1023/A:1022992023381}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/PruhsK03a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/Seiden03, author = {Steven S. Seiden}, title = {Barely Random Algorithms for Multiprocessor Scheduling}, journal = {J. Sched.}, volume = {6}, number = {3}, pages = {309--334}, year = {2003}, url = {https://doi.org/10.1023/A:1022960526107}, doi = {10.1023/A:1022960526107}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/Seiden03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/SourdK03, author = {Francis Sourd and Safia Kedad{-}Sidhoum}, title = {The One-Machine Problem with Earliness and Tardiness Penalties}, journal = {J. Sched.}, volume = {6}, number = {6}, pages = {533--549}, year = {2003}, url = {https://doi.org/10.1023/A:1026224610295}, doi = {10.1023/A:1026224610295}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/SourdK03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/Thangiah03, author = {Sam R. Thangiah}, title = {Computer-aided Scheduling of Public Transport}, journal = {J. Sched.}, volume = {6}, number = {4}, pages = {415--418}, year = {2003}, url = {https://doi.org/10.1023/A:1024073013353}, doi = {10.1023/A:1024073013353}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/Thangiah03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/Tsang03, author = {Edward P. K. Tsang}, title = {Constraint Based Scheduling: Applying Constraint Programming to Scheduling Problems}, journal = {J. Sched.}, volume = {6}, number = {4}, pages = {413--414}, year = {2003}, url = {https://doi.org/10.1023/A:1024016929283}, doi = {10.1023/A:1024016929283}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/Tsang03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/Vairaktarakis03, author = {George L. Vairaktarakis}, title = {Simple Algorithms for Gilmore-Gomory's Traveling Salesman and Related Problems}, journal = {J. Sched.}, volume = {6}, number = {6}, pages = {499--520}, year = {2003}, url = {https://doi.org/10.1023/A:1026200209386}, doi = {10.1023/A:1026200209386}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/Vairaktarakis03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/VieiraHL03, author = {Guilherme Ernani Vieira and Jeffrey W. Herrmann and Edward Lin}, title = {Rescheduling Manufacturing Systems: {A} Framework of Strategies, Policies, and Methods}, journal = {J. Sched.}, volume = {6}, number = {1}, pages = {39--62}, year = {2003}, url = {https://doi.org/10.1023/A:1022235519958}, doi = {10.1023/A:1022235519958}, timestamp = {Mon, 18 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/VieiraHL03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/WrenFKKPP03, author = {Anthony Wren and Sarah Fores and Ann S. K. Kwan and Raymond S. K. Kwan and Margaret Parker and Les G. Proll}, title = {A Flexible System for Scheduling Drivers}, journal = {J. Sched.}, volume = {6}, number = {5}, pages = {437--455}, year = {2003}, url = {https://doi.org/10.1023/A:1024854522373}, doi = {10.1023/A:1024854522373}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/WrenFKKPP03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.