Journal: European Journal of Operational Research

Found 7937 papers in total
Risk transportation via a clique number problem formulation
2004,
This paper deals with the risk transportation programming problem. A new approach...
A concise survey of scheduling with time-dependent processing times
2004,
We consider a class of machine scheduling problems in which the processing time of a...
A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage
2004,
The general scheduling problem in a flow shop with multiple processors (FSMP) is...
Hybrid flow-shop scheduling problems with multiprocessor task systems
2004,
Hybrid flow-shop problems and problems with multiprocessor task systems have remained...
No-wait flowshops with bicriteria of makespan and maximum lateness
2004,
We address the m -machine no-wait flowshop scheduling problem with a weighted sum of...
The complexity of two-job shop problems with multi-purpose unrelated machines
2004,
This paper deals with scheduling problems of two jobs with multi-purpose unrelated...
A fuzzy robust scheduling approach for product development projects
2004,
Efficient scheduling of a product development project is difficult, since a...
A Petri net model of a continuous flow transfer line with unreliable machines
2004,
A production line is studied with several machines in series. The machines are...
An exact algorithm for the identical parallel machine scheduling problem
2004,
The NP-hard classical deterministic scheduling problem of minimizing the makespan on...
Single machine batch scheduling with jointly compressible setup and processing times
2004,
A single machine batch scheduling problem is addressed. A batch is a set of jobs...
A repairing technique for the local search of the job-shop problem
2004,
The local search technique has become a widely used tool for solving many...
Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption
2004,
This paper considers a generalisation of the classical RCPSP problem: the resource...
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...
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
2004,
Describes a case study of supply chain collaboration facilitated by a decision support...
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
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
2004,
This paper examines the beneficial impact of information sharing in multi-echelon...
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
2004,
Spot markets have emerged for a broad range of commodities, and companies have started...
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
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
2004,
A practical nurse rostering problem, which arises at a ward of an Italian hospital, is...
Iterative restart technique for solving timetabling problems
2004,
Restart techniques for randomizing complete search algorithms were proposed recently...
Papers per page: