Country: Netherlands

Found 18376 papers in total
An optimization approach for supply chain management models with quantity discount policy
An optimization approach for supply chain management models with quantity discount policy
2007,
Owing to the difficulty of treating nonlinear functions, many supply chain management...
Supply chain cooperation in industrial districts: a simulation analysis
Supply chain cooperation in industrial districts: a simulation analysis
2007,
In the past few years the literature on supply chain management has widely emphasized...
Value of capacity pooling in supply chains with heterogeneous customers
Value of capacity pooling in supply chains with heterogeneous customers
2007,
We investigate the value of pooling capacity in supply chains that serve product...
Channel coordination using product returns for a supply chain with stochastic salvage capacity
Channel coordination using product returns for a supply chain with stochastic salvage capacity
2007,
We examine returns policy in a Newsboy framework. Unlike the prior literature,...
Analyzing the effect of the inventory policy on order and inventory variability with linear control theory
Analyzing the effect of the inventory policy on order and inventory variability with linear control theory
2007,
In this paper we apply linear control theory to study the effect of various inventory...
Coordination in decentralized assembly systems with uncertain component yields
Coordination in decentralized assembly systems with uncertain component yields
2007,
The literature on assembly systems with random component yields has focused on...
A stochastic and asymmetric-information framework for a dominant-manufacturer supply chain
A stochastic and asymmetric-information framework for a dominant-manufacturer supply chain
2007,
Consider a dominant manufacturer wholesaling a product to a retailer, who in turn...
Modeling and analysis of a supply–assembly–store chain
Modeling and analysis of a supply–assembly–store chain
2007,
We consider a supply–assembly–store chain with produce-to-stock strategy,...
NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time
NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time
2007,
Baker and Nuttle studied the following single-variable-resource scheduling problem:...
Single-machine and two-machine flowshop scheduling with general learning functions
Single-machine and two-machine flowshop scheduling with general learning functions
2007,
We show that the O( n log n ) (where n is the number of jobs) shortest processing time...
Fixed interval scheduling: models, applications, computational complexity and algorithms
Fixed interval scheduling: models, applications, computational complexity and algorithms
2007,
The defining characteristic of fixed interval scheduling problems is that each job has...
Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
2007,
This paper studies the single-machine scheduling problem with deteriorating jobs and...
Approximability of single machine scheduling with fixed jobs to minimize total completion time
Approximability of single machine scheduling with fixed jobs to minimize total completion time
2007,
We consider the single machine scheduling problem to minimize total completion time...
Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
2007,
In this paper, we consider a modified shifting bottleneck heuristic for complex job...
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
2007,
Over the last decade, many metaheuristics have been applied to the flowshop scheduling...
A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
2007,
In this paper, a particle swarm optimization algorithm (PSO) is presented to solve the...
A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling
A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling
2007,
In this study, a general framework is proposed that combines the distinctive features...
An exact parallel method for a bi-objective permutation flowshop problem
An exact parallel method for a bi-objective permutation flowshop problem
2007,
In this paper, we propose a parallel exact method to solve bi-objective combinatorial...
Problem F2‖Cmax with forbidden jobs in the first or last position is easy
Problem F2‖Cmax with forbidden jobs in the first or last position is easy
2007,
Saadani et al. studied the classical n -job flow shop scheduling problem F2‖C...
The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard
The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard
2007,
In this paper, we consider the single machine batching problem with family setup times...
A sequential exchange approach for minimizing earliness–tardiness penalties of single-machine scheduling with a common due date
A sequential exchange approach for minimizing earliness–tardiness penalties of single-machine scheduling with a common due date
2007,
This study focuses on a class of single-machine scheduling problems with a common due...
Feasible insertions in job shop scheduling, short cycles and stable sets
Feasible insertions in job shop scheduling, short cycles and stable sets
2007,
Insertion problems arise in scheduling when additional activities have to be inserted...
Single machine scheduling problems with controllable processing times and total absolute differences penalties
Single machine scheduling problems with controllable processing times and total absolute differences penalties
2007,
In this paper, we consider single machine scheduling problem in which job processing...
Optimal preemptive scheduling on uniform machines with discounted flowtime objectives
Optimal preemptive scheduling on uniform machines with discounted flowtime objectives
2007,
We consider the problem of scheduling n jobs on m parallel machines. Each job has a...
Papers per page: