๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Logistics scheduling: Analysis of two-stage problems

โœ Scribed by Yung-Chia Chang; Chung-Yee Lee

Book ID
107383966
Publisher
SP Systems Engineering Society of China
Year
2003
Tongue
English
Weight
353 KB
Volume
12
Category
Article
ISSN
1004-3756

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

LOGISTIC ANALYSIS OF STUDIES WITH TWO-ST
LOGISTIC ANALYSIS OF STUDIES WITH TWO-STAGE SAMPLING: A COMPARISON OF FOUR APPROACHES
โœ WALTER SCHILL; KARSTEN DRESCHER ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 526 KB

This paper discusses the analysis of two-stage studies where covariates are missing or measured with error at the first stage of sampling and are validated at the second stage in a subsample. Four recently developed approaches, the weighted pseudo-likelihood method of Flanders and Greenland (1991),

The complexity of two group scheduling p
The complexity of two group scheduling problems
โœ Jacek Blazewicz; Mikhail Y. Kovalyov ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Springer US ๐ŸŒ English โš– 94 KB

The problems of scheduling groups of jobs under the group technology assumption are studied. The two remaining open questions posed in the literature a decade ago about the computational complexity of these problems (J. Oper. Res. Soc., 1992; 43:395 -406), are answered. The parallel machine problem

Complexity of two dual criteria scheduli
Complexity of two dual criteria scheduling problems
โœ Yumei Huo; J.Y.-T. Leung; Hairong Zhao ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 185 KB

In this article we answer the complexity question of two dual criteria scheduling problems which had been open for a long time. We show that both problems are binary NP-hard.