Showing 1 - 10 of 97
A Vendor Managed Inventory (VMI) system consists of a manufacturing vendor and a number of retailers. In such a system, it is essential for the vendor to optimally determine retailer selection and other related decisions, such as the product’s replenishment cycle time and the wholesale price,...
Persistent link: https://www.econbiz.de/10010871104
Persistent link: https://www.econbiz.de/10010053872
Persistent link: https://www.econbiz.de/10009998456
Persistent link: https://www.econbiz.de/10009999175
The traditional hypothesis of “rationality” is far from perfect. Models of fairness solely based on consequence cannot explain why the same consequence of an action is perceived and reciprocated differently. A reciprocity model which accounts for both consequence and its underlying intention...
Persistent link: https://www.econbiz.de/10011097732
Persistent link: https://www.econbiz.de/10007600833
This paper deals with the robust optimization for the cyclic hoist scheduling problem with processing time window constraints. The robustness of a cyclic hoist schedule is defined as its ability to remain stable in the presence of perturbations or variations of certain degree in the hoist...
Persistent link: https://www.econbiz.de/10010939793
Batch processing machine scheduling in uncertain environment attracts more and more attention in the last decade. This paper deals with semi-online scheduling on two parallel batch processing machines with non-decreasing processing time of job. Jobs arrive over time in the online paradigm, and...
Persistent link: https://www.econbiz.de/10011010797
This paper focuses on guillotine cuts which often arise in real-life cutting stock problems. In order to construct a solution verifying guillotine constraints, the first step is to know how to determine whether a given cutting pattern is a guillotine pattern. For this purpose, we first...
Persistent link: https://www.econbiz.de/10005240458
In this article, we consider the single-machine scheduling problem with one availability constraint. We aim to minimize the weighted sum of completion times. We propose a branch-and-bound algorithm based on a set of improved lower bounds and heuristics. The numerical experiments show the...
Persistent link: https://www.econbiz.de/10005311738