Add to ORKGIn this paper, we focus on a scenario in which a company or a set of companies conforming a supply network must deliver a complex product (service) composed of several components (tasks) to be processed on a set of parallel flow-shops with a common deadline. Each flow-shop represents the manufacturing of an independent component of the product, or the set of activities of the service. We assume that the processing times are random variables following a given probability distribution. In this scenario, the product (service) is required to be finished by the deadline with a user-specified probability, and the decision-maker must decide about the starting times of each component/task while minimizing one of the following alternative goals: (a)...
Most classical scheduling formulations assume a fixed and known duration for each ac-tivity. In this...
This paper describes a simulation optimization algorithm for the Permutation Flow shop Problem with...
This dissertation is concerned with developing optimal strategies for the scheduling of stochastic j...
In this paper, we focus on a scenario in which a company or a set of companies conforming a supply n...
Modern companies have to face challenging configuration issues in their manufacturing chains. One of...
Greedy Randomized Adaptive Search Procedures (GRASP) are among the most popular metaheuristics for t...
In the production of complex Manufacturing-to-Order products, uncertainty may stem from a number of ...
A number of jobs are to be processed using a number of identical machines which operate in parallel....
In production and transportation logistics, it is frequent to have projects in which different tasks...
The production and delivery of rapidly perishable goods in distributed supply networks involves a nu...
Part 2: Knowledge Discovery and SharingInternational audienceRecent development of computer network ...
A number of identical machines operating in parallel are to be used to complete the processing of a ...
The two-machine flowshop problem, where setup and removal times are independent from processing time...
A set of four heuristic algorithms is presented to schedule tasks that have headlines and resource r...
In a distributed system or communication network tasks may need to be executed on more than one proc...
Most classical scheduling formulations assume a fixed and known duration for each ac-tivity. In this...
This paper describes a simulation optimization algorithm for the Permutation Flow shop Problem with...
This dissertation is concerned with developing optimal strategies for the scheduling of stochastic j...
In this paper, we focus on a scenario in which a company or a set of companies conforming a supply n...
Modern companies have to face challenging configuration issues in their manufacturing chains. One of...
Greedy Randomized Adaptive Search Procedures (GRASP) are among the most popular metaheuristics for t...
In the production of complex Manufacturing-to-Order products, uncertainty may stem from a number of ...
A number of jobs are to be processed using a number of identical machines which operate in parallel....
In production and transportation logistics, it is frequent to have projects in which different tasks...
The production and delivery of rapidly perishable goods in distributed supply networks involves a nu...
Part 2: Knowledge Discovery and SharingInternational audienceRecent development of computer network ...
A number of identical machines operating in parallel are to be used to complete the processing of a ...
The two-machine flowshop problem, where setup and removal times are independent from processing time...
A set of four heuristic algorithms is presented to schedule tasks that have headlines and resource r...
In a distributed system or communication network tasks may need to be executed on more than one proc...
Most classical scheduling formulations assume a fixed and known duration for each ac-tivity. In this...
This paper describes a simulation optimization algorithm for the Permutation Flow shop Problem with...
This dissertation is concerned with developing optimal strategies for the scheduling of stochastic j...