ANOR 2008 - PDF Preprint Papers

ANOR 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ANOR-2008 Paper

click to vote

ANOR
2008

171views more ANOR 2008»

A branch and bound method for the job-shop problem with sequence-dependent setup times

14 years 21 days ago

Download hal.archives-ouvertes.fr

This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...

Christian Artigues, Dominique Feillet

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	171	A branch and bound method for the job-shop problem with sequence-dependent setup times	claim
2	127	Computer science and decision theory	claim
3	123	An approach to predictive-reactive scheduling of parallel machines subject to disruptions	claim
4	116	Coordination mechanisms for inventory control in three-echelon serial and distribution systems	claim
5	112	Analysis of a tandem network model of a single-router Network-on-Chip	claim
6	108	A consensus model of political decision-making	claim
7	106	Application of multi-dimensional procurement auction in single-period inventory models	claim
8	96	How good are SPT schedules for fair optimality criteria	claim
9	93	Pruning in column generation for service vehicle dispatching	claim
10	90	Multiple orders per job batch scheduling with incompatible jobs	claim
11	89	Ordered sets with interval representation and ( m , n )-Ferrers relation	claim
12	83	Conditions of reverse bullwhip effect in pricing for price-sensitive demand functions	claim
13	76	Performance comparison of several priority schemes with priority jumps	claim
14	75	Geometric decay in level-expanding QBD models	claim
15	71	Stationary tail asymptotics of a tandem queue with feedback	claim
16	69	Moment characterization of matrix exponential and Markovian arrival processes	claim
17	69	Scheduling vessels and container-yard operations with conflicting objectives	claim
18	69	NP-hardness results for the aggregation of linear orders into median orders	claim
19	66	Optimization problems involving collections of dependent objects	claim
20	65	Convexity properties for interior operator games	claim
21	62	Aircraft and crew scheduling for fractional ownership programs	claim
22	61	Algorithms for finding clique-transversals of graphs	claim
23	57	On some ordinal models for decision making under uncertainty	claim
24	55	Supply chain scheduling: Just-in-time environment	claim
25	53	A globally convergent inexact Newton method with a new choice for the forcing term	claim
26	49	Periodic real-time scheduling: from deadline-based model to latency-based model	claim
27	49	Second order fluid models with general boundary behaviour	claim
28	45	QBD Markov chains on binomial-like trees and its application to multilevel feedback queues	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers