Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Chengbin Chu
Information about the author Chengbin Chu will soon be added to the site.
Found
35 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Approximation algorithms to solve real-life multicriteria cutting stock problems
1999
This paper addresses a real-life unidimensional cutting stock problem. The objective...
The cutting stock problem wih mixed objectives: Two heuristics based on dynamic programming
1999
The purpose of this paper is to provide efficient methods for solving a large spectrum...
Predictive maintenance: The one-unit replacement model
1998
Predictive maintenance consists in deciding whether or not to maintain a system...
Heuristic approaches for n/m/F/&Sgr;Ci scheduling problems
1997
In this paper, we address the flow shop scheduling problem, with the criterion of...
Heuristic procedures for minimizing makespan and the number of required pallets
1995
A heuristic procedure is developed for minimizing makespan in flow-shop scheduling...
Sequencing of parts in robotic cells
1997
This paper considers scheduling problems in robotic cells that produce a set of part...
A new class of scheduling criteria and their optimization
1996
The paper defines a new class of scheduling criteria called over-regular criteria....
Supply management in assembly systems
1993
The authors consider the case when n components are needed to assemble a given...
Efficient heuristics to minimize total flow time with release dates
1992
This paper addresses the one machine scheduling problem to minimize total flow time...
A branch-and-bound algorithm to minimize total flow time with unequal release dates
1992
This article examines the single-machine scheduling problem to minimize total flow...
A branch-and-bound algorithm to minimize total tardiness with different release dates
1992
This article deals with the scheduling problem for minimizing total tardiness with...
First Page
1
2
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers