The following pages link to Shi-Sheng Li (Q326476):
Displaying 46 items.
- (Q281785) (redirect page) (← links)
- New results on two-machine flow-shop scheduling with rejection (Q281786) (← links)
- Scheduling two job families on a single machine with two competitive agents (Q326478) (← links)
- Bi-criteria scheduling on a single parallel-batch machine (Q437901) (← links)
- Scheduling a bounded parallel-batching machine with incompatible job families and rejection (Q489155) (← links)
- Scheduling resumable deteriorating jobs on a single machine with non-availability constraints (Q620936) (← links)
- Parallel-machine scheduling with deteriorating jobs and rejection (Q708217) (← links)
- Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) (← links)
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times (Q841603) (← links)
- Improved algorithm for finding next-to-shortest paths (Q845719) (← links)
- Two-agent single machine scheduling with forbidden intervals (Q902407) (← links)
- A decision support system for materials requirements planning lot-sizing (Q910331) (← links)
- Scheduling with families of jobs and delivery coordination under job availability (Q1034606) (← links)
- (Q1117831) (redirect page) (← links)
- Some observations and extensions of the optimal TWK-power due-date determination and sequencing problem (Q1117832) (← links)
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (Q1640602) (← links)
- An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities (Q1679513) (← links)
- Online batch scheduling with kind release times and incompatible families to minimize makespan (Q1744626) (← links)
- Unbounded parallel-batch scheduling with family jobs and delivery coordination (Q1944952) (← links)
- Two-agent single-machine scheduling with cumulative deterioration (Q2001202) (← links)
- Minimizing total weighted late work on a single-machine with non-availability intervals (Q2165284) (← links)
- Single-machine scheduling with multi-agents to minimize total weighted late work (Q2197329) (← links)
- Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties (Q2228360) (← links)
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan (Q2268765) (← links)
- Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection (Q2331597) (← links)
- Two-agent scheduling with rejection on a single machine (Q2337544) (← links)
- Unbounded parallel-batching scheduling with two competitive agents (Q2434303) (← links)
- Bounded parallel-batching scheduling with two competing agents (Q2434316) (← links)
- SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS (Q2920364) (← links)
- (Q2991772) (← links)
- Study on deformation prediction of landslide based on genetic algorithm and improved BP neural network (Q3019245) (← links)
- SCHEDULING PROPORTIONALLY DETERIORATING JOBS IN TWO-MACHINE OPEN SHOP WITH A NON-BOTTLENECK MACHINE (Q3103656) (← links)
- (Q3175716) (← links)
- Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time (Q4689382) (← links)
- Scheduling with Rejection and a Deteriorating Maintenance Activity on a Single Machine (Q4978467) (← links)
- (Q4984023) (← links)
- Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs (Q5012893) (← links)
- (Q5017275) (← links)
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs (Q5058931) (← links)
- Multitasking scheduling problems with two competitive agents (Q5059462) (← links)
- (Q5171598) (← links)
- Group Scheduling with Two Competing Agents on a Single Machine (Q5174413) (← links)
- (Q5260673) (← links)
- Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs (Q5265640) (← links)
- Proportionate Flow Shop Scheduling with Rejection (Q5359056) (← links)
- Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)
