Beam search heuristics for the single machine scheduling problem with linear earliness and quadratic tardiness costs [PDF]
In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time. We present heuristic algorithms based on the beam search technique.
Jorge M. S. Valente
core
In this thesis, we study neighbourhoods of exponential size that can be searched in polynomial time. Such neighbourhoods are used in local search algorithms for classes of combinatorial optimisation problems.
Congram, Richard K., Congram, R.K.
core +1 more source
This paper presents a robust and adaptable framework for predictive–reactive rescheduling in identical parallel-machine environments. The proposed Multi-Purpose Intelligent Utility (MIU) methodology utilizes heuristic methods to efficiently address the ...
Mahmut İbrahim Ulucak, Hadi Gökçen
doaj +1 more source
Improved Lower Bounds for the Early/Tardy Scheduling Problem with No Idle Time [PDF]
In this paper we consider the single machine earliness/tardiness scheduling problem with no idle time. Two of the lower bounds previously developed for this problem are based on lagrangean relaxation and the multiplier adjustment method, and require an ...
Rui A. F. S. Alves, Jorge M. S. Valente
core
Practical solutions for a dock assignment problem with trailer transportation. [PDF]
We study a distribution warehouse in which trailers need to be assigned to docks for loading or unloading. A parking lot is used as a buffer zone and transportation between the parking lot and the docks is performed by auxiliary resources called terminal
Berghman, Lotte, Leus, Roel
core
School and work tardiness in high school students in rural Wisconsin [PDF]
Plan BBusinesses expect employees to arrive at the workplace with basic Asoft skills@ which include personal attributes like punctuality. The purpose of this research study was to examine the relationship between school and work tardiness in high school ...
Weade, Barbara Lee
core
Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date [PDF]
This paper deals with the total weighted tardiness minimization with a common due date on a single machine. The best previous approximation algorithm for this problem was recently presented in [H. Kellerer, V.A.
Kacem, Imed
core +1 more source
Single-Machine Scheduling with Simultaneous Learning Effects and Delivery Times
This paper studies the single-machine scheduling problem with truncated learning effect, time-dependent processing time, and past-sequence-dependent delivery time.
Zheng Liu, Ji-Bo Wang
doaj +1 more source
A Bi-objective Pre-emption Multi-mode Resource Constrained Project Scheduling Problem with due Dates in the Activities [PDF]
In this paper, a novel mathematical model for a preemption multi-mode multi-objective resource-constrained project scheduling problem with distinct due dates and positive and negative cash flows is presented.
zahra Sadat Hosseini +2 more
doaj
Improved Heuristics for the Early/Tardy Scheduling Problem with No Idle Time [PDF]
In this paper we consider the single machine earliness/tardiness scheduling problem with no idle time. We present two new heuristics, a dispatch rule and a greedy procedure, and also consider the best of the existing dispatch rules.
Rui A. F. S. Alves, Jorge M. S. Valente
core

