The following pages link to Guochun Tang (Q217044):
Displayed 50 items.
- Maximum latency scheduling problem on two-person cooperative games (Q358650) (← links)
- A note on machine scheduling with sum-of-logarithm-processing-time-based and position-based learning effects (Q454917) (← links)
- Single-machine scheduling problems with time and position dependent processing times (Q646660) (← links)
- Minimizing total completion time for re-entrant flow shop scheduling problems (Q650903) (← links)
- Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process (Q887883) (← links)
- Heuristic algorithms for two machine re-entrant flow shop (Q930923) (← links)
- Dense open-shop schedules with release times (Q955015) (← links)
- Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs (Q1288216) (← links)
- Single machine scheduling with controllable processing times and compression costs. II: Proof and theorems (Q1288217) (← links)
- Single machine scheduling with controllable processing times and compression costs. II: Heuristics for the general case (Q1288289) (← links)
- Single machine scheduling with common due data assignment in a group technology environment (Q1368494) (← links)
- Single machine scheduling with discretely controllable processing times (Q1373460) (← links)
- Study on specialist outpatient matching appointment and the balance matching model (Q1740392) (← links)
- A revised proof of the optimality for the Kise-Ibaraki-Mine algorithm (Q1926639) (← links)
- A note on ''parallel machine scheduling with non-simultaneous machine available time'' (Q1962027) (← links)
- A two-stage approach for surgery scheduling (Q2015795) (← links)
- Open-shop dense schedules: properties and worst-case performance ratio (Q2434260) (← links)
- Optimality proof of the Kise-Ibaraki-Mine algorithm (Q2434284) (← links)
- Convex quadratic programming relaxations for parallel machine scheduling with controllable processing times subject to release times (Q2583362) (← links)
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs (Q2638922) (← links)
- (Q2823379) (← links)
- (Q2858821) (← links)
- (Q2886016) (← links)
- (Q2886584) (← links)
- (Q2915936) (← links)
- (Q2916905) (← links)
- (Q2916957) (← links)
- (Q2927381) (← links)
- (Q2992924) (← links)
- (Q2993664) (← links)
- (Q2994026) (← links)
- (Q3014559) (← links)
- (Q3016609) (← links)
- (Q3054090) (← links)
- (Q3071522) (← links)
- (Q3073377) (← links)
- A Note on the Optimality Proof of the Kise-Ibaraki-Mine Algorithm (Q3100485) (← links)
- (Q3109767) (← links)
- (Q3110282) (← links)
- (Q3131408) (← links)
- (Q3170385) (← links)
- (Q3170971) (← links)
- (Q3307042) (← links)
- BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS (Q3397512) (← links)
- (Q3404886) (← links)
- (Q3414902) (← links)
- (Q3417238) (← links)
- (Q3518121) (← links)
- (Q3538656) (← links)
- (Q3572183) (← links)