The following pages link to T. C. Edwin Cheng (Q162228):
Displaying 50 items.
- Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine (Q1869884) (← links)
- On scheduling an unbounded batch machine (Q1870002) (← links)
- A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times (Q1876151) (← links)
- Lower bounds and semi on-line multiprocessor scheduling (Q1884352) (← links)
- Processing-plus-wait due dates in single-machine scheduling (Q1893346) (← links)
- Single machine batch scheduling with deadlines and resource dependent processing times (Q1924618) (← links)
- Single-machine common due window assignment and scheduling to minimize the total cost (Q1941535) (← links)
- Proportionate flow shop with controllable processing times (Q1964482) (← links)
- A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times (Q2009966) (← links)
- A meta-heuristic to solve the just-in-time job-shop scheduling problem (Q2028835) (← links)
- Two-agent integrated scheduling of production and distribution operations with fixed departure times (Q2076366) (← links)
- Parallel-machine scheduling in shared manufacturing (Q2076469) (← links)
- Production/inventory competition between firms with fixed-proportions co-production systems (Q2077918) (← links)
- Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics (Q2103001) (← links)
- Optimal selection of supply chain financing programmes for a financially distressed manufacturer (Q2106761) (← links)
- Lead-time quotation and hedging coordination in make-to-order supply chain (Q2116847) (← links)
- Which strategy is better for managing multi-product demand uncertainty: inventory substitution or probabilistic selling? (Q2140316) (← links)
- On the 3-color Ramsey numbers \(R(C_4,C_4,W_n)\) (Q2144222) (← links)
- Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach (Q2158031) (← links)
- Single-machine multitasking scheduling with job efficiency promotion (Q2168741) (← links)
- Degree sums and dominating cycles (Q2222926) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Two-agent single-machine scheduling with assignable due dates (Q2250186) (← links)
- Price and lead time decisions in dual-channel supply chains (Q2270300) (← links)
- Optimal production-inventory policy for the multi-period fixed proportions co-production system (Q2273903) (← links)
- A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem (Q2275945) (← links)
- Coordinating a two-supplier and one-retailer supply chain with forecast updating (Q2276099) (← links)
- Coupled task scheduling with exact delays: literature review and models (Q2282490) (← links)
- The single-item lot-sizing problem with two production modes, inventory bounds, and periodic carbon emissions capacity (Q2294332) (← links)
- Due date-related scheduling with two agents. Models and algorithms (Q2303121) (← links)
- Optimal online algorithms for MapReduce scheduling on two uniform machines (Q2329682) (← links)
- Single-machine batch scheduling of linear deteriorating jobs (Q2344768) (← links)
- Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines (Q2353644) (← links)
- Quality uncertainty and quality-compensation contract for supply chain coordination (Q2355108) (← links)
- Coordination of supply chains with bidirectional option contracts (Q2355867) (← links)
- Talent hold cost minimization in film production (Q2358484) (← links)
- A note on the subtree ordered median problem in networks based on nestedness property (Q2358843) (← links)
- A note on one-processor scheduling with asymmetric earliness and tardiness penalties (Q2367041) (← links)
- Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance (Q2379661) (← links)
- Classical duality and existence results for a multi-criteria supply-demand network equilibrium model (Q2379809) (← links)
- Absorbant of generalized de Bruijn digraphs (Q2380030) (← links)
- The algorithmic complexity of the minus clique-transversal problem (Q2383654) (← links)
- Some values of Ramsey numbers for \(C_4\) versus stars (Q2396751) (← links)
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (Q2400041) (← links)
- Scheduling with controllable release dates and processing times: Makespan minimization (Q2433440) (← links)
- Scheduling with controllable release dates and processing times: total completion time minimization (Q2433441) (← links)
- Bounded parallel-batching scheduling with two competing agents (Q2434316) (← links)
- Single-machine scheduling and due date assignment with rejection and position-dependent processing times (Q2438395) (← links)
- Scheduling with a position-weighted learning effect (Q2439518) (← links)
- Optimal algorithms for semi-online machine covering on two hierarchical machines (Q2441779) (← links)