The following pages link to Cheng, T. C. Edwin (Q162228):
Displaying 50 items.
- (Q181200) (redirect page) (← links)
- (Q222913) (redirect page) (← links)
- The complexity of scheduling starting time dependent tasks with release times (Q293188) (← links)
- Production planning and pricing policy in a make-to-stock system with uncertain demand subject to machine breakdowns (Q296705) (← links)
- Product variety and channel structure strategy for a retailer-Stackelberg supply chain (Q297198) (← links)
- Make-or-buy service capacity decision in a supply chain providing after-sales service (Q297258) (← links)
- Buyback contracts with price-dependent demands: effects of demand uncertainty (Q297374) (← links)
- A mean-shift algorithm for large-scale planar maximal covering location problems (Q322404) (← links)
- Two-agent scheduling in a flowshop (Q322895) (← links)
- Rescheduling on identical parallel machines with machine disruptions to minimize total completion time (Q322965) (← links)
- A hybrid evolutionary algorithm to solve the job shop scheduling problem (Q324301) (← links)
- A tabu search/path relinking algorithm to solve the job shop scheduling problem (Q337272) (← links)
- Greening and performance relativity: an application in the shipping industry (Q337389) (← links)
- Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling (Q337595) (← links)
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time (Q339589) (← links)
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem (Q342188) (← links)
- Single-machine scheduling with past-sequence-dependent delivery times and a linear deterioration (Q380458) (← links)
- Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness (Q398925) (← links)
- Scheduling a single server in a two-machine flow shop (Q424733) (← links)
- Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time (Q433105) (← links)
- Optimal order lot sizing and pricing with free shipping (Q439520) (← links)
- Single-machine scheduling with accelerating learning effects (Q474156) (← links)
- Extreme tenacity of graphs with given order and size (Q489128) (← links)
- Four single-machine scheduling problems involving due date determination decisions (Q497630) (← links)
- Polarity graphs and Ramsey numbers for \(C_4\) versus stars (Q507485) (← links)
- Nonlinear augmented Lagrangian for nonconvex multiobjective optimization (Q542580) (← links)
- Two-agent scheduling with position-based deteriorating jobs and learning effects (Q546060) (← links)
- Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness (Q547127) (← links)
- Semi-online scheduling with known partial information about job sizes on two identical machines (Q551204) (← links)
- Semi-on-line multiprocessor scheduling with given total processing time (Q557814) (← links)
- The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem (Q583101) (← links)
- Paired-domination in inflated graphs (Q596115) (← links)
- Complexity results for flow-shop and open-shop scheduling problems with transportation delays (Q596453) (← links)
- A vector network equilibrium problem with a unilateral constraint (Q654936) (← links)
- Scheduling with job-dependent learning effects and multiple rate-modifying activities (Q656606) (← links)
- Minimizing makespan in a two-machine flow shop with effects of deterioration and learning (Q694178) (← links)
- Single machine scheduling with resource dependent release times and processing times (Q704120) (← links)
- Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times (Q707000) (← links)
- Several semi-online scheduling problems on two identical machines with combined information (Q714838) (← links)
- Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm (Q828853) (← links)
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment (Q829197) (← links)
- Single-machine scheduling with trade-off between number of tardy jobs and compression cost (Q835563) (← links)
- Parallel-machine scheduling of simple linear deteriorating jobs (Q837167) (← links)
- An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan (Q845960) (← links)
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs (Q850246) (← links)
- Heuristics for two-machine flowshop scheduling with setup times and an availability constraint (Q850314) (← links)
- 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)
