Country: Netherlands

Found 18376 papers in total
A heuristic job-shop scheduling algorithm to minimize the total holding cost of completed and in-process products subject to no tardy jobs
A heuristic job-shop scheduling algorithm to minimize the total holding cost of completed and in-process products subject to no tardy jobs
2006,
Meeting due dates is the most important goal of scheduling if the due date of each job...
A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network
A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network
2005,
In the routing open-shop problem, jobs are located at nodes of a transportation...
On the single machine total tardiness problem
On the single machine total tardiness problem
2005,
In this paper we study the single machine total tardiness problem. We first identify...
Vehicle minimization for periodic deliveries
Vehicle minimization for periodic deliveries
2005,
We consider the problem of minimizing the number of vehicles required to make strictly...
A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
2005,
An O( n 2 ) algorithm is presented for the n jobs m parallel machines problem with...
A heuristic to schedule flexible job-shop in a glass factory
A heuristic to schedule flexible job-shop in a glass factory
2005,
We describe the design and implementation of a scheduling system in a glass factory....
Continuous filling and emptying of storage systems in constraint-based scheduling
Continuous filling and emptying of storage systems in constraint-based scheduling
2005,
In constraint-based scheduling, storage systems are modeled by a class of resources...
Scheduling of continuous and discontinuous material flows with intermediate storage restrictions
Scheduling of continuous and discontinuous material flows with intermediate storage restrictions
2005,
This paper deals with scheduling batch (i.e., discontinuous), continuous, and...
A comprehensive review and evaluation of permutation flowshop heuristics
A comprehensive review and evaluation of permutation flowshop heuristics
2005,
In this work we present a review and comparative evaluation of heuristics and...
Scheduling unit execution time and unit communication delay outforests to minimize maximum lateness
Scheduling unit execution time and unit communication delay outforests to minimize maximum lateness
2005,
In this paper, a well known NP -hard problem with parallel processors, precedence...
Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach
Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach
2005,
This paper considers the problem of scheduling jobs on unrelated parallel machines to...
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
2005,
In this paper we study both the non-preemptive and preemptive versions of the popular...
Single machine scheduling to minimize total weighted tardiness
Single machine scheduling to minimize total weighted tardiness
2005,
The problem of minimizing the total weighted tardiness in single machine scheduling is...
Positive half-products and scheduling with controllable processing times
Positive half-products and scheduling with controllable processing times
2005,
We study the single machine scheduling problem with controllable job processing times...
The two-machine flow-shop problem with weighted late work criterion and common due date
The two-machine flow-shop problem with weighted late work criterion and common due date
2005,
The paper is on the two-machine non-preemptive flow-shop scheduling problem with a...
Complexity results for flow-shop problems with a single server
Complexity results for flow-shop problems with a single server
2005,
Flow-shop problems with a single server are generalizations of classical flow-shop...
Maximization of solution flexibility for robust shop scheduling
Maximization of solution flexibility for robust shop scheduling
2005,
We consider the problem of introducing flexibility in the schedule determination phase...
Static hedging of multivariate derivatives by simulation
Static hedging of multivariate derivatives by simulation
2005,
We propose an approximate static hedging procedure for multivariate derivatives. The...
Finite buffer polling models with routing
Finite buffer polling models with routing
2005,
This paper analyzes a finite buffer polling system with routing. Finite buffers are...
An action-research based instrument for monitoring continuous quality improvement
An action-research based instrument for monitoring continuous quality improvement
2005,
Despite containing an extensive body of normative or prescriptive studies, quality...
A scatter search algorithm for project scheduling under partially renewable resources
A scatter search algorithm for project scheduling under partially renewable resources
2006,
In this paper we develop a heuristic algorithm, based on Scatter Search, for project...
Justification and RCPSP: A technique that pays
Justification and RCPSP: A technique that pays
2005,
The objective of this paper is to show that justification is a simple technique that...
New computational results for the discrete time/cost trade-off problem with time-switch constraints
New computational results for the discrete time/cost trade-off problem with time-switch constraints
2005,
Recently, time-switch constraints have been introduced in the literature by Yang and...
Network decomposition-based benchmark results for the discrete time–cost tradeoff problem
Network decomposition-based benchmark results for the discrete time–cost tradeoff problem
2005,
In project management, the project duration can often be compressed by accelerating...
Papers per page: