Country: Netherlands

Found 18376 papers in total
Quality defaults and work-in-process inventory
Quality defaults and work-in-process inventory
1995,
The objective of this paper is to analyze the interactions between quality defaults...
Nesting planning based on production priorities and technological efficiency
Nesting planning based on production priorities and technological efficiency
1995,
The purpose and contribution of this work is in developing a methodology for...
Optimal recovery strategies for manufacturing systems
Optimal recovery strategies for manufacturing systems
1995,
This paper presents a framework to generate optimal error recovery strategies in...
Contract design and the control of quality in a conflictual environment
Contract design and the control of quality in a conflictual environment
1995,
This paper provides an approach to quality supply by a supplier and quality inspection...
Modeling global market entry decision by fuzzy logic with an application to country risk assessment
Modeling global market entry decision by fuzzy logic with an application to country risk assessment
1995,
This research introduces a fuzzy logic framework to support global market entry...
Semiactive, active, and non-delay schedules for the resource-constrained project scheduling problem
Semiactive, active, and non-delay schedules for the resource-constrained project scheduling problem
1995,
We consider the resource-constrained project scheduling problem (RCPSP). The focus of...
Weighted flow time-bounds for scheduling identical processors
Weighted flow time-bounds for scheduling identical processors
1995,
We present two lower bounds for the identical parallel processor weighted now time...
Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times
Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times
1995,
The paper deals with the single-machine scheduling problem in which each job has a...
Scheduling to minimize the total resource consumption with a constraint on the sum of completion times
Scheduling to minimize the total resource consumption with a constraint on the sum of completion times
1995,
We consider the problem of scheduling a set of jobs on a single machine where the...
An application of genetic algorithms for flow shop problems
An application of genetic algorithms for flow shop problems
1995,
This research studies an application of genetic algorithms for flow shop problems with...
Heuristics for scheduling a single machine subject to unequal job release times
Heuristics for scheduling a single machine subject to unequal job release times
1995,
Solving realistic scheduling problems in a reasonable amount of computer time almost...
Bicriterion stochastic scheduling on one or more machines
Bicriterion stochastic scheduling on one or more machines
1995,
This paper is concerned with two types of bicriterion stochastic scheduling problems,...
Multiple and bicriteria scheduling: A literature survey
Multiple and bicriteria scheduling: A literature survey
1995,
Real life scheduling problems require the decision maker to consider a number of...
Minimizing late jobs in the general one machine scheduling problem
Minimizing late jobs in the general one machine scheduling problem
1995,
In this paper, the problem of minimizing the number of late jobs on one machine is...
Resource-constrained job scheduling with recyclable resources
Resource-constrained job scheduling with recyclable resources
1995,
In resource-constrained project scheduling problems, resources are typically...
Scheduling on a 2-machine flowshop subject to random breakdowns with a makespan objective function
Scheduling on a 2-machine flowshop subject to random breakdowns with a makespan objective function
1995,
Two-machine flowshop scheduling problems have been discussed in the literature...
Exact and approximation algorithms for the operational fixed interval scheduling problem
Exact and approximation algorithms for the operational fixed interval scheduling problem
1995,
The Operational Fixed Interval Scheduling Problem (OFISP) is characterized as the...
Heuristics for scheduling in flowshop with multiple objectives
Heuristics for scheduling in flowshop with multiple objectives
1995,
Most of the heuristics for flowshop scheduling aim at minimizing makespan. However,...
FUN: A dynamic method for scheduling problems
FUN: A dynamic method for scheduling problems
1995,
Real time control is an important part of scheduling problems, which have become a...
Generalized pairwise interchanges and machine scheduling
Generalized pairwise interchanges and machine scheduling
1995,
In this paper a generalization of pairwise interchanges is considered and applied to...
Scheduling jobs within time windows on identical parallel machines: New model and algorithms
Scheduling jobs within time windows on identical parallel machines: New model and algorithms
1995,
This article analyses the problem of scheduling non-preemptive jobs processed within...
Job-shop scheduling: Computational study of local search and large-step optimization methods
Job-shop scheduling: Computational study of local search and large-step optimization methods
1995,
We present a computational study of different local search and large-step optimization...
A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
1995,
Local search techniques are reported to be effective for many optimization problems...
An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date
An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date
1995,
In 1991, Hall et al. showed that the problem of minimizing the mean earliness and...
Papers per page: