The following pages link to T. C. Edwin Cheng (Q162228):
Displaying 50 items.
- Batch delivery scheduling with batch delivery cost on a single machine (Q852935) (← links)
- Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan (Q857361) (← links)
- Single-machine scheduling with periodic maintenance to minimize makespan (Q858282) (← links)
- A simple linear time algorithm for scheduling with step-improving processing times (Q869002) (← links)
- Application of structural equation modeling to evaluate the intention of shippers to use internet services in liner shipping (Q869630) (← links)
- An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint (Q878557) (← links)
- A note on a proof of SPT optimality for single-machine sequencing problems via the transportation problem (Q909576) (← links)
- A decision support system for materials requirements planning lot-sizing (Q910331) (← links)
- A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem (Q913649) (← links)
- Dynamic programming approach to the single-machine sequencing problem with different due-dates (Q913669) (← links)
- Optimal due-date assignment and sequencing in a single machine shop (Q917427) (← links)
- On the NP-completeness of the n/m/parallel/\(\sum_{i\leq i\leq m}\{\sum w_ j\sum t_ j\}\) scheduling problem (Q917428) (← links)
- Optimal assignment of slack due-dates and sequencing in a single-machine shop (Q917429) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- The Ramsey numbers \(R(C_m,K_7)\) and \(R(C_7,K_8)\) (Q925037) (← links)
- Remarks on the minus (signed) total domination in graphs (Q932611) (← links)
- Heavy cycles in \(k\)-connected weighted graphs with large weighted degree sums (Q941397) (← links)
- Bounds on the clique-transversal number of regular graphs (Q943436) (← links)
- An application of the Turán theorem to domination in graphs (Q948691) (← links)
- A hybrid algorithm for the single-machine total tardiness problem (Q954025) (← links)
- Production scheduling with supply and delivery considerations to minimize the makespan (Q958556) (← links)
- An analytical study of the modification ability of distribution centers (Q958584) (← links)
- Vector equilibrium flows with nonconvex ordering relations (Q967238) (← links)
- An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan (Q975438) (← links)
- Coordination of supply chains by option contracts: a cooperative game theory approach (Q992663) (← links)
- A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667) (← links)
- The Ramsey number for a cycle of length six versus a clique of order eight (Q1003750) (← links)
- Johnson's rule, composite jobs and the relocation problem (Q1011248) (← links)
- Bounded single-machine parallel-batch scheduling with release dates and rejection (Q1017446) (← links)
- Extreme values of the sum of squares of degrees of bipartite graphs (Q1024470) (← links)
- Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times (Q1025256) (← links)
- Upper bounds on the upper signed total domination number of graphs (Q1028436) (← links)
- \(\frac{3}{2}\)-approximation for two-machine no-wait flowshop scheduling with availability constraints (Q1029003) (← links)
- Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan (Q1038382) (← links)
- The Ramsey numbers for cycles versus wheels of even order (Q1041200) (← links)
- Optimal total-work-content-power due-date determination and sequencing (Q1097161) (← links)
- An algorithm for the CON due-date determination and sequencing problem (Q1097162) (← links)
- Optimal common due-date with limited completion time deviation (Q1097833) (← links)
- Minimizing the maximum deviation of job completion time about a common due-date (Q1098766) (← links)
- An alternative proof of optimality for the common due-date assignment problem (Q1107429) (← links)
- On a single-machine optimal constant due-date assignment and sequencing problem (Q1110452) (← links)
- An economic order quantity model with demand-dependent unit cost (Q1116875) (← links)
- Some observations and extensions of the optimal TWK-power due-date determination and sequencing problem (Q1117832) (← links)
- An economic production quantity model with flexibility and reliability considerations (Q1120458) (← links)
- Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine (Q1178637) (← links)
- A review of stochastic modelling of delay and capacity at unsignalized priority intersections (Q1199505) (← links)
- Optimal production policy for decaying items with decreasing demand (Q1262819) (← links)
- Single machine scheduling with batch deliveries (Q1278307) (← links)
- Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness (Q1296374) (← links)
- Multiple-machine scheduling with earliness, tardiness and completion time penalties (Q1302709) (← links)
