J. Scheduling - researchr journal

researchr

You are not signed in
Sign in
Sign up

499	--	513	J. J. Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng. Single machine batch scheduling problem with family setup times and release dates to minimize makespan
515	--	543	Andrew Lim, Brian Rodrigues, Caixia Wang. Two-machine flow shop problems with a single server
545	--	557	Peter Damaschke. Scheduling search procedures: The wheel of fortune
559	--	568	Han Hoogeveen, Linda van Norden, Steef L. van de Velde. Lower bounds for minimizing total completion time in a two-machine flow shop
569	--	570	Wenhua Li, Maurice Queyranne, Maxim Sviridenko, Jinjiang Yuan. Approximation algorithms for shop scheduling problems with minsum objective: A correction

403	--	432	Marco Chiarandini, Mauro Birattari, Krzysztof Socha, Olivia Rossi-Doria. An effective hybrid algorithm for university course timetabling
433	--	452	Berit Johannes. Scheduling parallel jobs to minimize the makespan
453	--	468	Chengbin Chu. A faster polynomial algorithm for 2-cyclic robotic scheduling
469	--	491	J. Christopher Beck, Patrick Prosser, Evgeny Selensky. A case study of mutual routing-scheduling reformulation
493	--	495	Isto Aho, Erkki Mäkinen. On a parallel machine scheduling problem with precedence constraints

315	--	341	Jonathan F. Bard, Lin Wan. The task assignment problem for unrestricted movement between workstation groups
343	--	364	Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng. An O(n:::2:::) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
365	--	379	Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko. Minimizing migrations in fair multiprocessor scheduling of persistent tasks
381	--	387	George Steiner, Zhihui Xue. On the connection between a cyclic job shop and a reentrant flow shop scheduling problem
389	--	396	Thomas A. Roemer. A note on the complexity of the concurrent open shop problem
397	--	400	. Conference Diary

199	--	201	Jonathan Bard, Cynthia Barnhart. Editorial
203	--	221	Milind A. Sohoni, Ellis Johnson, T. Glenn Bailey. Operational airline reserve crew planning
223	--	253	Lucio Bianco, Paolo Dell Olmo, Stefano Giordani. Scheduling models for air traffic control in terminal areas
255	--	278	Rüdiger Nissen, Knut Haase. Duty-period-based network model for crew rescheduling in European airlines
279	--	298	Stephane Bratu, Cynthia Barnhart. Flight operations recovery: New approaches considering passenger recovery
299	--	310	Bo Chen, Yinyu Ye, Jiawei Zhang. Lot-sizing scheduling with batch setup times

95	--	96	Sanja Petrovic. Editorial
97	--	114	Hassan Ghaziri, Ibrahim H. Osman. Self-organizing feature maps for the vehicle routing problem with backhauls
115	--	132	Edmund K. Burke, Sanja Petrovic, Rong Qu. Case-based heuristic selection for timetabling problems
133	--	152	Rema Padman, Dan Zhu. Knowledge integration using problem spaces: A study in resource-constrained project scheduling
153	--	176	Andreas Drexl, Alf Kimms, Lars Matthießen. Algorithms for the car sequencing and the level scheduling problem
177	--	193	Aris Anagnostopoulos, Laurent Michel, Pascal Van Hentenryck, Yannis Vergados. A simulated annealing approach to the traveling tournament problem

5	--	0	Edmund K. Burke, Michael Pinedo, Steef L. van de Velde. Editorial
7	--	34	Christopher Geiger, Reha Uzsoy, Haldun Aytug. Rapid Modeling and Discovery of Priority Dispatching Rules: An Autonomous Learning Approach
35	--	48	Chung-Yee Lee, Joseph Y.-T. Leung, Gang Yu. Two Machine Scheduling under Disruptions with Transportation Considerations
49	--	62	Cees Duin, E. Van Der Sluis. On the Complexity of Adjacent Resource Scheduling
63	--	69	Edward G. Coffman Jr., George S. Lueker. Approximation Algorithms for Extensible Bin Packing
71	--	73	Marek Chrobak, Christoph Dürr, Wojciech Jawor, Lukasz Kowalik, Maciej Kurowski. A Note on Scheduling Equal-Length Jobs to Maximize Throughput
75	--	77	Agachai Sumalee. Advanced Modeling for Transit Operations and Service Planning

runs on WebDSL