The following pages link to Jinjiang Yuan (Q215029):
Displaying 50 items.
- Two-machine open-shop scheduling with rejection to minimize the makespan (Q280183) (← links)
- Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart (Q281805) (← links)
- Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines (Q290334) (← links)
- Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness (Q306084) (← links)
- Rescheduling with new orders and general maximum allowable time disruptions (Q330107) (← links)
- Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines (Q391787) (← links)
- Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs (Q436585) (← links)
- Bi-criteria scheduling on a single parallel-batch machine (Q437901) (← links)
- On matching cover of graphs (Q463743) (← links)
- Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs (Q479220) (← links)
- Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
- A note on unbounded parallel-batch scheduling (Q495685) (← links)
- On graphs with a unique perfect matching (Q497377) (← links)
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time (Q668523) (← links)
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost (Q668562) (← links)
- (Q706998) (redirect page) (← links)
- Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times (Q707000) (← links)
- Parallel-machine scheduling with deteriorating jobs and rejection (Q708217) (← links)
- A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints (Q714856) (← links)
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs (Q835640) (← links)
- The weighted link ring loading problem (Q839671) (← links)
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times (Q841603) (← links)
- A note on the complexity of flow shop scheduling with transportation constraints (Q859706) (← links)
- Upper minus domination in a claw-free cubic graph (Q860466) (← links)
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal (Q864174) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective: A correction (Q880571) (← links)
- Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption (Q881562) (← links)
- Pareto minimizing total completion time and maximum cost with positional due indices (Q888315) (← links)
- Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time (Q905848) (← links)
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan (Q924160) (← links)
- An inverse model for the most uniform problem (Q924880) (← links)
- On-line scheduling on a batch machine to minimize makespan with limited restarts (Q935242) (← links)
- Single-machine scheduling under the job rejection constraint (Q964407) (← 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)
- Unbounded parallel batch scheduling with job delivery to minimize makespan (Q1003499) (← links)
- Single machine parallel-batch scheduling with deteriorating jobs (Q1006057) (← links)
- Bounded single-machine parallel-batch scheduling with release dates and rejection (Q1017446) (← links)
- A best online algorithm for scheduling on two parallel batch machines (Q1019748) (← links)
- On-line scheduling with delivery time on a single batch machine (Q1022586) (← links)
- Online scheduling in a parallel batch processing system to minimize makespan using restarts (Q1022602) (← links)
- Scheduling with families of jobs and delivery coordination under job availability (Q1034606) (← links)
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead (Q1034639) (← links)
- A note on the single machine scheduling to minimize the number of tardy jobs with deadlines (Q1038367) (← links)
- Single machine scheduling with release dates and rejection (Q1042081) (← links)
- Edge-deletable IM-extendable graphs with minimum number of edges (Q1045004) (← links)
- A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs (Q1278296) (← links)
- The bandwidth of the complement of a \(k\)-tree (Q1288223) (← links)
- Profile minimization problem for matrices and graphs (Q1327828) (← links)
- Harper-type lower bounds and the bandwidths of the compositions of graphs (Q1381861) (← links)
