Narrow search
Showing 1 - 10 of 159
Cover Image
Minimizing Single-Machine Completion Time Variance
Ventura, Jose A.; Weng, Michael X. - In: Management Science 41 (1995) 9, pp. 1448-1455
In this article the problem of minimizing the completion time variance in n-job, single-machine scheduling is …
Persistent link: https://www.econbiz.de/10009203970
Cover Image
A Polyhedral Approach for the Staff Rostering Problem
Felici, Giovanni; Gentile, Claudio - In: Management Science 50 (2004) 3, pp. 381-393
In this paper we formulate and efficiently solve staff scheduling problems for large organizations that provide …
Persistent link: https://www.econbiz.de/10009208907
Cover Image
Optimisation of sequencing and scheduling in hybrid flow shop environment using heuristic approach
Sridhar, S.; Prabaharan, T.; Saravanan, M. - In: International Journal of Logistics Economics and … 2 (2010) 4, pp. 331-351
This paper considers the hybrid flow shop scheduling problem. Most real world scheduling problems are NP-hard in nature …
Persistent link: https://www.econbiz.de/10010668814
Cover Image
A meta-heuristic approach to car allocation problem to reduce transportation cost over a fixed number of routes
Das, Prasun; Hossain, Saddam; Gupta, Abhijit - In: International Journal of Data Analysis Techniques and … 2 (2010) 1, pp. 85-102
proposed and implemented to schedule the cars efficiently along the routes under the existing logistics. A mathematical model …
Persistent link: https://www.econbiz.de/10008755539
Cover Image
A polynomial algorithm for P | p<Subscript>j</Subscript>=1, r<Subscript>j</Subscript>, outtree | ∑ C<Subscript>j</Subscript>
Brucker, Peter; Hurink, Johann; Knust, Sigrid - In: Mathematical Methods of Operations Research 56 (2003) 3, pp. 407-412
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was open. A set of jobs …
Persistent link: https://www.econbiz.de/10010999571
Cover Image
Scheduling trams in the morning
Blasum, Ulrich; Bussieck, Michael R.; Hochstättler, … - In: Mathematical Methods of Operations Research 49 (1999) 1, pp. 137-148
In this note, we prove ??-completeness of the following problem: Given a set of trams of different types, which are stacked on sidings in their depot and an order in which trams of specified types are supposed to leave. Is there an assignment of trams to departure times without any shunting...
Persistent link: https://www.econbiz.de/10010999609
Cover Image
A polynomial algorithm for P | p j=1, r j, outtree | ∑ C j
Brucker, Peter; Hurink, Johann; Knust, Sigrid - In: Computational Statistics 56 (2003) 3, pp. 407-412
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was open. A set of jobs …
Persistent link: https://www.econbiz.de/10010847527
Cover Image
Scheduling UET task systems with concurrency on two parallel identical processors
Brucker, Peter; Knust, Sigrid; Roper, Duncan; Zinder, Yakov - In: Computational Statistics 52 (2000) 3, pp. 369-387
in scheduling theory. In contrast to the conventional models, where each task requires only one processor, we consider a …
Persistent link: https://www.econbiz.de/10010847568
Cover Image
Upper bound on the number of processors for scheduling with interprocessor communication delays
Moukrim, Aziz - In: Computational Statistics 52 (2000) 1, pp. 99-113
The problem of scheduling a task system with communication delays on multiprocessor systems is known to be NP-hard in … for scheduling problems with communication delays. We prove that the minimum number of partitioning paths of the …
Persistent link: https://www.econbiz.de/10010847688
Cover Image
Preemptive job-shop scheduling problems with a fixed number of jobs
Brucker, Peter; Kravchenko, Svetlana A.; Sotskov, Yuri N. - In: Computational Statistics 49 (1999) 1, pp. 41-76
It is shown that the two machine preemptive job-shop problem with mean flow-time or makespan objective function and three jobs is NP-hard. This contrasts the fact that the nonpreemptive versions of these problems are polynomially solvable if the number of jobs is arbitrary but fixed. It is also...
Persistent link: https://www.econbiz.de/10010847987