Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
C.Y. Lee
Information about the author C.Y. Lee will soon be added to the site.
Found
11 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Workforce planning in mixed model assembly systems
1997
Serial assembly systems are formed by arranging several production cells or stations...
A new dynamic-programming algorithm for the single item capacitated dynamic lot-size model
1994
We develop a new dynamic programming method for the single item capacitated dynamic...
A dynamic-programming algorithm for dynamic lot-size models with piecewise-linear costs
1994
We propose a new algorithm for dynamic lot size models (LSM) in which production and...
Due window scheduling for parallel machines
1994
Just-In-Time concepts are of increasing importance in today's competitive...
Job shop scheduling with a genetic algorithm and machine learning
1997
Dynamic job shop scheduling has been proven to be an intractable problem for...
Business process management-Survey and methodology
1995
Due to the growing concern about the competitiveness of U.S. industry in the...
A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
1995
A job scheduling problem with distinct due dates in a single machine is considered....
Minimizing total completion time on batch processing machines
1993
The authors study the problem of minimizing total completion time on single and...
An algorithm for the design of multitype concentrator networks
1993
In recent years remarkable progress has been witnessed in the development of the...
Product batching and batch sequencing for NC punch presses
1993
This paper proposes a two-stage practical product batching and batch sequencing...
An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type
1991
Consider a generalization of the multiproduct capacitated facility location problem in...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers