Search results for "90B35"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
33	Han Hoogeveen, Tsuyoshi Kawaguchi	Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases.	IPCO	1996	DBLP DOI BibTeX RDF	special cases, heuristics, NP-hardness, polynomial algorithms, worst-case analysis, total completion time, Flowshop
23	Jean-Charles Billaut, Francis Sourd	Single machine scheduling with forbidden start times.	4OR	2009	DBLP DOI BibTeX RDF	MSC classification (2000) 90B35, 90C39
23	Imed Kacem, Mohamed Haouari	Approximation algorithms for single machine scheduling with one unavailability period.	4OR	2009	DBLP DOI BibTeX RDF	MSC classification (2000) 90B35
23	Mohamed Haouari, Mahdi Jemmali	Maximizing the minimum completion time on parallel machines.	4OR	2008	DBLP DOI BibTeX RDF	MSC classification 90B35
23	Domenico Conforti, Francesca Guerriero, Rosita Guido	Optimization models for radiotherapy patient scheduling.	4OR	2008	DBLP DOI BibTeX RDF	MSC Classification (2000) 90B35, 90B90
23	Yasmín Á. Ríos-Solís	Scheduling with earliness-tardiness penalties and parallel machines.	4OR	2008	DBLP DOI BibTeX RDF	MSC classification (2000) 90B35, 90C27, 90C59, 90C20, 90C39
23	Daniel Quadt, Heinrich Kuhn	Capacitated lot-sizing with extensions: a review.	4OR	2008	DBLP DOI BibTeX RDF	MSC Classification (2000) 90B30, 90B35, 90C27, 90C90, 90C10, 90C59
23	Arka P. Ghosh, Ananda P. Weerasinghe	Optimal buffer size for a stochastic processing network in heavy traffic.	Queueing Syst. Theory Appl.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 60K25, 60J70, 90B35, 90B22, 68M20
23	Jeroen Beliën	Exact and heuristic methodologies for scheduling in hospitals: problems, formulations and algorithms.	4OR	2007	DBLP DOI BibTeX RDF	MSC classification 90B35, 65K05, 90C11, 90B36, 49M27
23	Cyril Canon	Personnel scheduling in the Call Center industry.	4OR	2007	DBLP DOI BibTeX RDF	MSC classification 90B35, 90B70, 90C11, 90B36
23	Alexander Grigoriev, Maxim Sviridenko, Marc Uetz	Machine scheduling with resource dependent processing times.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90B35, 68Q25, 68M20
23	J. M. van den Akker, Guido Diepen, J. A. Hoogeveen	A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems.	CPAIOR	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (Revision 1991) 90B35
23	Fabrice Tercinet, Emmanuel Néron, Christophe Lenté	Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem.	4OR	2006	DBLP DOI BibTeX RDF	MSC classification 90B35, 90C27
23	György Dósa, Yong He	Semi-Online Algorithms for Parallel Machine Scheduling Problems.	Computing	2004	DBLP DOI BibTeX RDF	AMS Subject Classification 90B35, 90C27
23	T. C. Edwin Cheng, Mikhail Y. Kovalyov	Scheduling a Single Server in a Two-machine Flow Shop.	Computing	2003	DBLP DOI BibTeX RDF	AMS Subject Classifications: 90B35
23	Uriel Feige, Christian Scheideler	Improved Bounds for Acyclic Job Shop Scheduling.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 68M20, 90B35, 68W25
23	Eric J. Anderson, T. S. Jayram, Tracy Kimbrel	Tighter Bounds on Preemptive Job Shop Scheduling with Two Machines.	Computing	2001	DBLP DOI BibTeX RDF	AMS Subject Classifications: 68Q25, 90B35
23	Y. He, X. Min	On-Line Uniform Machine Scheduling with Rejection.	Computing	2000	DBLP DOI BibTeX RDF	AMS Subject Classifications: 90B35, 90C27
23	Peter Brucker, Sigrid Knust	Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags.	Computing	1999	DBLP DOI BibTeX RDF	AMS Subject Classifications: 90B35