Lu Lingfa

Lingfa Lu

Information about the author Lingfa Lu will soon be added to the site.
Found 8 papers in total
Single-machine scheduling with production and rejection costs to minimize the maximum earliness
Single-machine scheduling with production and rejection costs to minimize the maximum earliness
2017
In this paper, we consider the single‐machine scheduling problem with...
Parallel-machine scheduling with release dates and rejection
Parallel-machine scheduling with release dates and rejection
2016
In this paper, we consider the parallel‐machine scheduling problem with release...
On‐line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time
On‐line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time
2012
In this paper, we consider the on‐line integrated production and outbound...
Optimal algorithms for single‐machine scheduling with rejection to minimize the makespan
Optimal algorithms for single‐machine scheduling with rejection to minimize the makespan
2011
In this paper we consider the single‐machine scheduling problem with rejection....
Unbounded parallel batch scheduling with job delivery to minimize makespan
Unbounded parallel batch scheduling with job delivery to minimize makespan
2008
We consider unbounded parallel batch scheduling with job delivery to minimize...
Single machine scheduling with job delivery to minimize makespan
Single machine scheduling with job delivery to minimize makespan
2008
In the single machine scheduling problem with job delivery to minimize makespan, jobs...
A note on the complexity of flow shop scheduling with transportation constraints
A note on the complexity of flow shop scheduling with transportation constraints
2007
This note investigates two-machine flow shop scheduling with transportation...
Rescheduling with release dates to minimize total sequence disruption under a limit on the makespan
Rescheduling with release dates to minimize total sequence disruption under a limit on the makespan
2007
In this paper, we consider the rescheduling problem for jobs on a single machine with...
Papers per page: