The following pages link to Cheng He (Q262443):
Displayed 38 items.
- Improved algorithms for single machine scheduling with release dates and rejections (Q262445) (← links)
- Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826) (← links)
- Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness (Q295879) (← links)
- Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan (Q300969) (← links)
- Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost (Q457296) (← links)
- Notes on a hierarchical scheduling problem on identical machines (Q506158) (← links)
- Minimizing total completion time for preemptive scheduling with release dates and deadline constraints (Q902745) (← links)
- On-line scheduling on a batch machine to minimize makespan with limited restarts (Q935242) (← links)
- A DP algorithm for minimizing makespan and total completion time on a series-batching machine (Q987835) (← links)
- Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan (Q995579) (← links)
- A note on the single machine scheduling to minimize the number of tardy jobs with deadlines (Q1038367) (← links)
- Prognostics and health management of life-supporting medical instruments (Q1740405) (← links)
- Bounded serial-batching scheduling for minimizing maximum lateness and makespan (Q1751110) (← links)
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives (Q1788999) (← links)
- Unbounded serial-batching scheduling on hierarchical optimization (Q2059199) (← links)
- Medical rolling bearing fault prognostics based on improved extreme learning machine (Q2060047) (← links)
- Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost (Q2081468) (← links)
- Serial-batching scheduling with two agents to minimize makespan and maximum cost (Q2215193) (← links)
- Improved algorithms for two-agent scheduling on an unbounded serial-batching machine (Q2234745) (← links)
- Two-agent scheduling of time-dependent jobs (Q2410089) (← links)
- An Improved Algorithm for a Bicriteria Batching Scheduling Problem (Q2845028) (← links)
- BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN (Q2931723) (← links)
- An improved binary search algorithm for the Multiple-Choice Knapsack Problem (Q2954365) (← links)
- (Q3052575) (← links)
- SOME IMPROVED ALGORITHMS ON THE SINGLE MACHINE HIERARCHICAL SCHEDULING WITH TOTAL TARDINESS AS THE PRIMARY CRITERION (Q3069759) (← links)
- (Q3070927) (← links)
- (Q3405330) (← links)
- Bicriteria scheduling for due date assignment with total weighted tardiness (Q4553877) (← links)
- Hierarchical optimization on an unbounded parallel-batching machine (Q4579881) (← links)
- (Q4823845) (← links)
- Hierarchical minimization of two maximum costs on a bounded serial-batching machine (Q5001362) (← links)
- (Q5142948) (← links)
- (Q5197262) (← links)
- (Q5367777) (← links)
- (Q5383745) (← links)
- (Q5497535) (← links)
- (Q5747394) (← links)
- On fixed-parameter solvability of the minimax path location problem (Q6063573) (← links)