The following pages link to Ling-Fa Lu (Q1656203):
Displayed 36 items.
- (Q249093) (redirect page) (← links)
- Two-machine open-shop scheduling with rejection to minimize the makespan (Q280183) (← links)
- New results on two-machine flow-shop scheduling with rejection (Q281786) (← links)
- Parallel-machine scheduling with release dates and rejection (Q295880) (← links)
- Rescheduling with new orders and general maximum allowable time disruptions (Q330107) (← links)
- In-house production and outsourcing under different discount schemes on the total outsourcing cost (Q829187) (← links)
- A note on the complexity of flow shop scheduling with transportation constraints (Q859706) (← links)
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan (Q924160) (← links)
- Single-machine scheduling under the job rejection constraint (Q964407) (← links)
- Unbounded parallel batch scheduling with job delivery to minimize makespan (Q1003499) (← links)
- Bounded single-machine parallel-batch scheduling with release dates and rejection (Q1017446) (← links)
- Single machine scheduling with release dates and rejection (Q1042081) (← links)
- Competitive project scheduling on two unbounded parallel batch machines (Q1656205) (← links)
- Scheduling problems with rejection to minimize the maximum flow time (Q1691942) (← links)
- Single-machine scheduling with positional due indices and positional deadlines (Q2010931) (← links)
- Pareto-scheduling of two competing agents with their own equal processing times (Q2140187) (← links)
- Single machine scheduling with rejection and generalized parameters (Q2149874) (← links)
- Single machine scheduling with rejection to minimize the weighted makespan (Q2151365) (← links)
- Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery (Q2176828) (← links)
- Integrated production and delivery scheduling on a serial batch machine to minimize the makespan (Q2257290) (← links)
- Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time (Q2342682) (← links)
- Single-machine scheduling with production and rejection costs to minimize the maximum earliness (Q2410087) (← links)
- Single machine unbounded parallel-batch scheduling with forbidden intervals (Q2426551) (← links)
- Single machine scheduling with release dates and job delivery to minimize the makespan (Q2481956) (← links)
- RESCHEDULING WITH RELEASE DATES TO MINIMIZE TOTAL SEQUENCE DISRUPTION UNDER A LIMIT ON THE MAKESPAN (Q3502863) (← links)
- SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN (Q3521606) (← links)
- Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time (Q4561187) (← links)
- Online Single Machine Scheduling to Minimize the Maximum Starting Time (Q4595323) (← links)
- Single Machine Scheduling with Outsourcing Under Different Fill Rates or Quantity Discount Rates (Q5216801) (← links)
- A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan (Q5244301) (← links)
- Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time (Q5964074) (← links)
- Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost (Q6053958) (← links)
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work (Q6077487) (← links)
- Parallel-batch scheduling with rejection: structural properties and approximation algorithms (Q6113447) (← links)
- Single machine scheduling with rejection to minimize the \(k\)-th power of the makespan (Q6113846) (← links)
- Order acceptance and scheduling with delivery under generalized parameters (Q6179281) (← links)