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:
Scheduling a proportionate flow shop of batching machines
Journal of Scheduling - Tập 23 - Trang 575-593 - 2020
In this paper we study a proportionate flow shop of batching machines with release dates and a fixed number
$$m \ge 2$$
of machines. The scheduling problem has so far barely received any attention in the literature, but recently its importance has increased significantly, due to applications in th......
Coupled task scheduling with time-dependent processing times
Journal of Scheduling - Tập 24 - Trang 223-236 - 2021
The single machine coupled task scheduling problem includes a set of jobs, each with two separated tasks, and there is an exact delay between the tasks. We investigate the single machine coupled task scheduling problem with the objective of minimizing the makespan under identical processing time for the first task and identical delay period for all jobs, and the time-dependent processing time sett......
Assigning multiple activities to work shifts
Journal of Scheduling - Tập 15 - Trang 239-251 - 2010
In some companies such as large retail stores, the employees perform different activities (e.g., cashier or clerk in a specific department) to respond to a customer demand for each activity that varies over the planning horizon and must be fulfilled as soon as possible. For a given time period, this demand translates into an ideal number of employees required for the corresponding activity. During......
Review of real-time vehicle schedule recovery methods in transportation services
Journal of Scheduling - Tập 17 - Trang 541-567 - 2013
This paper presents a comprehensive review on methods for real-time schedule recovery in transportation services. The survey concentrates on published research on recovery of planned schedules in the occurrence of one or several severe disruptions such as vehicle breakdowns, accidents, and delays. Only vehicle assignment and rescheduling are reviewed; crew scheduling and passenger logistics proble......
Scheduling multiple divisible loads in homogeneous star systems
Journal of Scheduling - Tập 11 - Trang 347-356 - 2008
In this paper we analyze scheduling multiple divisible loads on a star-connected system of identical processors. It is shown that this problem is computationally hard. Some special cases appear to be particularly difficult, so it is not even known if they belong to the class NP. Exponential algorithms and special cases solvable in polynomial time are presented.
Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problem
Journal of Scheduling - Tập 12 - Trang 361-374 - 2008
While in classical scheduling theory the locations of machines are assumed to be fixed we will show how to tackle location and scheduling problems simultaneously. Obviously, this integrated approach enhances the modeling power of scheduling for various real-life problems. In this paper, we introduce in an exemplary way theory and three polynomial solution algorithms for the planar ScheLoc makespan......
Optimally rescheduling jobs with a Last-In-First-Out bufferAbstract This paper considers single-machine scheduling problems in which a given solution, i.e., an ordered set of jobs, has to be improved as much as possible by re-sequencing the jobs. The need for rescheduling may arise in different contexts, e.g., due to changes in the job data or because of the local objective in a stage of a supply chain that is not aligned w... ...
Journal of Scheduling - - 2021
Optimal and online preemptive scheduling on uniformly related machines
Journal of Scheduling - Tập 12 - Trang 517-527 - 2009
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an optimal schedule. Using the standard doubling technique, this yields a 4-competitive deterministic and an e≈2.71-competitive randomized online algorithm. In addition, it matches the performance of the previously known alg......
Late acceptance hill-climbing for high school timetabling
Journal of Scheduling - Tập 19 - Trang 453-465 - 2015
The application of the Late Acceptance Hill-Climbing (LAHC) to solve the High School Timetabling Problem is the subject of this manuscript. The original algorithm and two variants proposed here are tested jointly with other state-of-art methods to solve the instances proposed in the Third International Timetabling Competition. Following the same rules of the competition, the LAHC-based algorithms ......
Tổng số: 643
- 1
- 2
- 3
- 4
- 5
- 6
- 10