Similar Search Results

Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs

Kang, Sungmin; Malik, Kavindra; Thomas, L. Joseph - In: Management Science 45 (1999) 2, pp. 273-289

Industrial lotsizing and scheduling pose very difficult analytical problems. We propose an unconventional model that …

Persistent link: https://www.econbiz.de/10009191105

Constructing School Timetables Using Simulated Annealing: Sequential and Parallel Algorithms

Abramson, D. - In: Management Science 37 (1991) 1, pp. 98-113

This paper considers a solution to the school timetabling problem. The timetabling problem involves scheduling a number …

Persistent link: https://www.econbiz.de/10009191192

Optimal Lead Time Policies

Spearman, Mark L.; Zhang, Rachel Q. - In: Management Science 45 (1999) 2, pp. 290-295

This paper examines two due-date setting problems first studied by Wein (1991). The first problem seeks to minimize the average due-date lead time (due-date minus arrival date) of jobs subject to a constraint on the fraction of tardy jobs (Problem I) while the second uses the same objective...

Persistent link: https://www.econbiz.de/10009191273

A Note on Variance Reducing Group Maintenance Policies

Wilson, John G. - In: Management Science 42 (1996) 3, pp. 452-456

Group replacement policies for machines operating in parallel are generally evaluated by computing the associated expected cost per unit time. However, as with all stochastically evolving systems, variance should play an important managerial role. No matter which policy is used by the...

Persistent link: https://www.econbiz.de/10009191608

Price and Service Discrimination in Queuing Systems: Incentive Compatibility of Gc\mu Scheduling

Mieghem, Jan A. Van - In: Management Science 46 (2000) 9, pp. 1249-1267

comprehensive executable approach is proposed that analytically specifies scheduling, delay distributions and prices for arbitrary … economic analysis. The generalized c\mu (Gc\mu ) scheduling rule that emerges is dynamic so that, in general, service grades … information and are established for Gc\mu scheduling when service times are homogeneous and customers atomistic. Grade IC induces …

Persistent link: https://www.econbiz.de/10009191815

Dynamic Allocation of Airline Check-In Counters: A Queueing Optimization Approach

Parlar, Mahmut; Sharafali, Moosa - In: Management Science 54 (2008) 8, pp. 1410-1424

This paper was motivated by an observation in an international airport with regard to allocation of resources for check-in counters. In an exclusive check-in counter system, each flight has a dedicated number of counters that will be open until at least a half-hour before the scheduled departure...

Persistent link: https://www.econbiz.de/10009192019

Coping with the Loss of Pooling Synergy in Cellular Manufacturing Systems

Suresh, Nallan C.; Meredith, Jack R. - In: Management Science 40 (1994) 4, pp. 466-483

-oriented scheduling rule are used. …

Persistent link: https://www.econbiz.de/10009197334

Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues

Keskinocak, Pinar; Ravi, R.; Tayur, Sridhar - In: Management Science 47 (2001) 2, pp. 264-279

scheduling with lead-time quotation: a basic model with a single customer type, and an enhanced model where an additional second … times are 100% reliable. These models are related to well-known scheduling problems, which have been studied in both offline …

Persistent link: https://www.econbiz.de/10009197574

Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times

Schutten, J. M. J.; Velde, S. L. van de; Zijm, W. H. M. - In: Management Science 42 (1996) 8, pp. 1165-1174

We address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and family setup times …

Persistent link: https://www.econbiz.de/10009197980

Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem

Lee, Chung-Yee; Cheng, T. C. E.; Lin, B. M. T. - In: Management Science 39 (1993) 5, pp. 616-625

This paper considers minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. After problem …

Persistent link: https://www.econbiz.de/10009198016