Lingfa Lu

From MaRDI portal
Person:1656203

Available identifiers

zbMath Open lu.lingfaMaRDI QIDQ1656203

List of research outcomes





PublicationDate of PublicationType
Single machine scheduling with rejection and a non-availability interval to minimize the maximum delivery completion time plus the total rejection cost2024-05-23Paper
Order acceptance and scheduling with delivery under generalized parameters2024-01-16Paper
Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work2023-10-18Paper
Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost2023-09-27Paper
Single machine scheduling with rejection to minimize the \(k\)-th power of the makespan2023-08-10Paper
Parallel-batch scheduling with rejection: structural properties and approximation algorithms2023-07-11Paper
Single machine scheduling with rejection to minimize the weighted makespan2022-07-01Paper
Single machine scheduling with rejection and generalized parameters2022-06-29Paper
Pareto-scheduling of two competing agents with their own equal processing times2022-05-20Paper
In-house production and outsourcing under different discount schemes on the total outsourcing cost2021-05-05Paper
Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery2020-05-05Paper
Single machine scheduling with outsourcing under different fill rates or quantity discount rates2020-02-20Paper
Single-machine scheduling with positional due indices and positional deadlines2019-11-28Paper
A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan2019-11-20Paper
Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time2018-12-10Paper
Competitive project scheduling on two unbounded parallel batch machines2018-08-10Paper
Scheduling problems with rejection to minimize the maximum flow time2018-01-25Paper
Online single machine scheduling to minimize the maximum starting time2017-11-30Paper
Single-machine scheduling with production and rejection costs to minimize the maximum earliness2017-10-17Paper
Rescheduling with new orders and general maximum allowable time disruptions2016-10-24Paper
Parallel-machine scheduling with release dates and rejection2016-06-14Paper
New results on two-machine flow-shop scheduling with rejection2016-05-11Paper
Two-machine open-shop scheduling with rejection to minimize the makespan2016-05-04Paper
Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time2016-02-26Paper
Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time2015-04-29Paper
Integrated production and delivery scheduling on a serial batch machine to minimize the makespan2015-02-24Paper
Single-machine scheduling under the job rejection constraint2010-04-15Paper
Single machine scheduling with release dates and rejection2009-12-07Paper
Bounded single-machine parallel-batch scheduling with release dates and rejection2009-05-19Paper
Unbounded parallel batch scheduling with job delivery to minimize makespan2009-03-04Paper
SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN2008-08-26Paper
The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan2008-05-28Paper
RESCHEDULING WITH RELEASE DATES TO MINIMIZE TOTAL SEQUENCE DISRUPTION UNDER A LIMIT ON THE MAKESPAN2008-05-20Paper
Single machine unbounded parallel-batch scheduling with forbidden intervals2008-04-22Paper
Single machine scheduling with release dates and job delivery to minimize the makespan2008-04-15Paper
A note on the complexity of flow shop scheduling with transportation constraints2007-01-16Paper

Research outcomes over time

This page was built for person: Lingfa Lu