The following pages link to T. C. Edwin Cheng (Q162228):
Displaying 50 items.
- One-operator-two-machine flowshop scheduling with setup and dismounting times (Q1302722) (← links)
- The time dependent machine makespan problem is strongly NP-complete (Q1304510) (← links)
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs (Q1315994) (← links)
- Single-machine scheduling to minimize earliness and number of tardy jobs (Q1321352) (← links)
- Optimal scheduling in film production to minimize talent hold cost (Q1321428) (← links)
- One-machine batching and sequencing of multiple-type items (Q1332828) (← links)
- Optimal assignment of due-dates for preemptive single-machine scheduling (Q1341396) (← links)
- Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs (Q1342333) (← links)
- Single-machine scheduling with trade-off between number of tardy jobs and resource allocation (Q1362988) (← links)
- Two-stage flowshop scheduling with a common second-stage machine (Q1373162) (← links)
- Multi-machine scheduling with variance minimization (Q1392562) (← links)
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. (Q1399584) (← links)
- Single machine scheduling of unit-time jobs with controllable release dates (Q1407253) (← links)
- A concise survey of scheduling with time-dependent processing times (Q1410319) (← links)
- Approximability of two-machine no-wait flowshop scheduling with availability constraints. (Q1413925) (← links)
- Single machine batch scheduling with jointly compressible setup and processing times. (Q1417506) (← links)
- A strategic model for supply chain design with logical constraints: Formulation and solution. (Q1422373) (← links)
- Single machine scheduling with deadlines and increasing rates of processing times (Q1567197) (← links)
- Parallel machine batching and scheduling with deadlines (Q1567300) (← links)
- An improved heuristic for two-machine flowshop scheduling with an availability constraint (Q1591549) (← links)
- A permutation flow-shop scheduling problem with convex models of operation processing times (Q1593519) (← links)
- Single supplier scheduling for multiple deliveries (Q1599327) (← links)
- Scheduling with job release dates, delivery times and preemption penalties (Q1603554) (← links)
- Scheduling groups of unit length jobs on two identical parallel machines. (Q1606911) (← links)
- Two-machine flowshop scheduling with consecutive availability constraints (Q1606963) (← links)
- Heuristics for two-machine no-wait flowshop scheduling with an availability constraint (Q1607139) (← links)
- The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times (Q1608433) (← links)
- Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints (Q1610141) (← links)
- Minimizing weighted number of early and tardy jobs with a common due window involving location penalty (Q1610881) (← links)
- On three color Ramsey numbers \(R(C_4, C_4, K_{1, n})\) (Q1625783) (← links)
- A periodic collaboration and coexistence management model with the oscillation effect for complex mega infrastructure project under the risk of infection (Q1632911) (← links)
- Integrated production and multiple trips vehicle routing with time windows and uncertain travel times (Q1634047) (← links)
- Mean-risk analysis of wholesale price contracts with stochastic price-dependent demand (Q1699183) (← links)
- Bin packing game with a price of anarchy of \(\frac{3}{2}\) (Q1702843) (← links)
- Supply option contracts with spot market and demand information updating (Q1754184) (← links)
- Buy online and pick up in-store: design of the service area (Q1754358) (← links)
- Why and how do branders sell new products on flash sale platforms? (Q1754759) (← links)
- Which inspection approach is better to prevent drug fraud: announced or unannounced? (Q1757713) (← links)
- Algorithms better than LPT for semi-online scheduling with decreasing processing times (Q1758275) (← links)
- Resource-constrained flowshop scheduling with separate resource recycling operations (Q1762095) (← links)
- A self-guided genetic algorithm for permutation flowshop scheduling problems (Q1762134) (← links)
- Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities (Q1762135) (← links)
- Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem (Q1772847) (← links)
- Two-machine flowshop batching and scheduling (Q1772969) (← links)
- Convergence results for weak efficiency in vector optimization problems with equilibrium constraints (Q1780600) (← links)
- Two-machine flowshop scheduling with job class setups to minimize total flowtime (Q1781550) (← links)
- Advances in stochastic programming and robust optimization for supply chain planning (Q1782184) (← links)
- Re-entrant flowshop scheduling with learning considerations to minimize the makespan (Q1787748) (← links)
- Common due date assignment and scheduling with ready times (Q1867095) (← links)
- An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note (Q1867103) (← links)
