Journal of Scheduling
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
New competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits of pre-processing
Journal of Scheduling - Tập 14 - Trang 157-171 - 2009
We study the resource-constrained project scheduling problem with stochastic activity durations. We introduce a new class of scheduling policies for solving this problem, which make a number of a-priori sequencing decisions in a pre-processing phase while the remaining decisions are made dynamically during project execution. The pre-processing decisions entail the addition of extra precedence cons......
Using aggregation to reduce response time variability in cyclic fair sequences
Journal of Scheduling - Tập 14 - Trang 39-55 - 2009
Fair sequences are useful in a variety of applications, including manufacturing and computer systems. This paper considers the generation of cyclic fair sequences for a given set of products, each of which must be produced multiple times in each cycle. The objective is to create a sequence so that, for each product, the variability of the time between consecutive completions is minimized. Because ......
Solving the nuclear dismantling project scheduling problem by combining mixed-integer and constraint programming techniques and metaheuristicsAbstract Scheduling of megaprojects is very challenging because of typical characteristics, such as expected long project durations, many activities with multiple modes, scarce resources, and investment decisions. Furthermore, each megaproject has additional specific characteristics to be considered. Since the number of nuclear dismantling projects is expected to in... ...
Journal of Scheduling - - 2021
List scheduling for jobs with arbitrary release times and similar lengths
Journal of Scheduling - Tập 10 - Trang 365-373 - 2007
This paper considers the problem of on-line scheduling a list of independent jobs in which each job has an arbitrary release time and length in [1,r] with r≥1 on m parallel identical machines. For the list scheduling algorithm, we give an upper bound of the competitive ratio for any m≥1 and show that the upper bound is tight when m=1. When m=2, we present a tight bound for r≥4. For r<4, we give a......
A survey of dynamic scheduling in manufacturing systems
Journal of Scheduling - Tập 12 Số 4 - Trang 417-431 - 2009
An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
Journal of Scheduling - Tập 25 - Trang 589-621 - 2022
This paper presents the problem of batching and scheduling jobs belonging to incompatible job families on unrelated-parallel machines. More specifically, we investigate cost-efficient approaches for solving batching and scheduling problems concerning the desired lower bounds on batch sizes (
$${LB}_{b}$$
......
A random generator of resource-constrained multi-project network problems
Journal of Scheduling - Tập 13 - Trang 143-161 - 2009
Many scheduling problems in project management, manufacturing, and elsewhere require the generation of activity networks to test proposed solution methods. Single-network generators have been used for the resource-constrained project scheduling problem (RCPSP). Since the first single-network generator was proposed in 1993, several advances have been reported in the literature. However, these gener......
Erratum to: Scheduling jobs on parallel machines to minimize a regular step total cost function
Journal of Scheduling - Tập 14 - Trang 539-540 - 2011
Introduction to the special issue: project scheduling under uncertainty
Journal of Scheduling - Tập 10 - Trang 151-152 - 2007
Tổng số: 643
- 1
- 2
- 3
- 4
- 5
- 6
- 10