Country: Netherlands

Found 18376 papers in total
Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times
Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times
2004,
The problem of makespan minimization in a flow shop with two machines when the input...
Search and ambush games with capacities
Search and ambush games with capacities
2004,
Search games with capacities are bipersonal zero-sum games where a player has to hide...
Supply-side collaboration and its value in supply chains
Supply-side collaboration and its value in supply chains
2004,
Collaboration has been recognized as a significant process that holds the value...
Travail, transparency and trust: A case study of computer-supported collaborative supply chain planning in high-tech electronics
Travail, transparency and trust: A case study of computer-supported collaborative supply chain planning in high-tech electronics
2004,
Describes a case study of supply chain collaboration facilitated by a decision support...
Hierarchical coordination mechanisms within the supply chain
Hierarchical coordination mechanisms within the supply chain
2004,
The paper analyses operational coordination mechanisms between a producer and a...
Object oriented modeling and decision support for supply chains
Object oriented modeling and decision support for supply chains
2004,
Numerous algorithms and tools have been deployed in supply chain modeling and problem...
The impact of information enrichment on the bullwhip effect in supply chains: A control engineering perspective
The impact of information enrichment on the bullwhip effect in supply chains: A control engineering perspective
2004,
This paper examines the beneficial impact of information sharing in multi-echelon...
Selective discount for supplier–buyer coordination using common replenishment epochs
Selective discount for supplier–buyer coordination using common replenishment epochs
2004,
A supplier may reduce its order costs by providing an incentive in the form of price...
Optimal procurement strategies for online spot markets
Optimal procurement strategies for online spot markets
2004,
Spot markets have emerged for a broad range of commodities, and companies have started...
Interval reliability of typical systems with partially known probabilities
Interval reliability of typical systems with partially known probabilities
2004,
Most probabilistic methods of the system reliability analysis assume that the...
Staff scheduling and rostering: A review of applications, methods and models
Staff scheduling and rostering: A review of applications, methods and models
2004,
This paper presents a review of staff scheduling and rostering, an area that has...
A greedy-based neighborhood search approach to a nurse rostering problem
A greedy-based neighborhood search approach to a nurse rostering problem
2004,
A practical nurse rostering problem, which arises at a ward of an Italian hospital, is...
Iterative restart technique for solving timetabling problems
Iterative restart technique for solving timetabling problems
2004,
Restart techniques for randomizing complete search algorithms were proposed recently...
Local search for shift design
Local search for shift design
2004,
Designing shifts is one of the important stages in the general workforce scheduling...
A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem
A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem
2004,
This study explores the application of neural network-based heuristics to the...
Using tabu search with longer-term memory and relaxation to create examination timetables
Using tabu search with longer-term memory and relaxation to create examination timetables
2004,
Several methods have been developed over the past four decades for producing...
Global constraints for round robin tournament scheduling
Global constraints for round robin tournament scheduling
2004,
In the presence of side-constraints and optimization criteria, round robin tournament...
A rollout metaheuristic for job shop scheduling problems
A rollout metaheuristic for job shop scheduling problems
2004,
In this paper we deal with solution algorithms for a general formulation of the job...
An integer programming formulation for a case study in university timetabling
An integer programming formulation for a case study in university timetabling
2004,
A novel 0–1 integer programming formulation of the university timetabling...
Solving the resource-constrained project scheduling problem with large neighbourhood search
Solving the resource-constrained project scheduling problem with large neighbourhood search
2004,
This paper presents the Local Search with Subproblem Exact Resolution (LSSPER) method...
An automated university course timetabling system developed in a distributed environment: A case study
An automated university course timetabling system developed in a distributed environment: A case study
2004,
In the present study we examine the design and implementation of a computer network...
A population-based approach to the resource-constrained project scheduling problem
A population-based approach to the resource-constrained project scheduling problem
2004,
We present a population-based approach to the RCPSP. The procedure has two phases. The...
A case study of single shift planning and scheduling under annualized hours: A simple three-step approach
A case study of single shift planning and scheduling under annualized hours: A simple three-step approach
2004,
In the current economic and industrial conditions, with demand ever fluctuating,...
Using the free disposal hull formulation of data envelopment analysis to evaluate a multi-criteria problem in parallel machine scheduling
Using the free disposal hull formulation of data envelopment analysis to evaluate a multi-criteria problem in parallel machine scheduling
2004,
We consider the problem of scheduling jobs on parallel machines when there are two...
Papers per page: