The following pages link to Byung-Cheon Choi (Q299835):
Displaying 50 items.
- Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs (Q299837) (← links)
- A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs (Q319449) (← links)
- Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty (Q322893) (← links)
- An adaptive crashing policy for stochastic time-cost tradeoff problems (Q342024) (← links)
- Minimizing makespan in an ordered flow shop with machine-dependent processing times (Q411247) (← links)
- Two-machine flow shop scheduling problem with an outsourcing option (Q421578) (← links)
- A vector space approach to tag cloud similarity ranking (Q763537) (← links)
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling (Q835569) (← links)
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed (Q852963) (← links)
- Single machine scheduling problems with resource dependent release times (Q868136) (← links)
- Single machine scheduling problem with controllable processing times and resource dependent release times (Q877039) (← links)
- Complexity of a scheduling problem with controllable processing times (Q969518) (← links)
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time (Q989525) (← links)
- Flow shops with machine maintenance: ordered and proportionate cases (Q992582) (← links)
- Complexity of single machine scheduling subject to nonnegative inventory constraints (Q992655) (← links)
- Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks (Q1753463) (← links)
- A note on makespan minimization in proportionate flow shops (Q1944041) (← links)
- Two-stage proportionate flexible flow shop to minimize the makespan (Q1945694) (← links)
- Job release scheduling problem: complexity and an approximation algorithm (Q1946231) (← links)
- A single-machine scheduling problem with uncertainty in processing times and outsourcing costs (Q1992893) (← links)
- Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty (Q2045022) (← links)
- Scheduling with generalized and periodic due dates under single- and two-machine environments (Q2115317) (← links)
- A single machine scheduling with generalized and periodic due dates to minimize total deviation (Q2127609) (← links)
- Single-machine scheduling with resource-dependent processing times and multiple unavailability periods (Q2142677) (← links)
- Two-machine flow shops with an optimal permutation schedule under a storage constraint (Q2197318) (← links)
- Scheduling two projects with controllable processing times in a single-machine environment (Q2215194) (← links)
- A just-in-time scheduling problem with two competing agents (Q2228372) (← links)
- Two-agent single-machine scheduling problem with just-in-time jobs (Q2250441) (← links)
- Outsourcing and scheduling for two-machine ordered flow shop scheduling problems (Q2253540) (← links)
- Two-stage production scheduling with an outsourcing option (Q2275802) (← links)
- Strong NP-hardness of minimizing total deviation with generalized and periodic due dates (Q2294353) (← links)
- A linear time-cost tradeoff problem with multiple milestones under a comb graph (Q2424814) (← links)
- Polynomiality of sparsest cuts with fixed number of sources (Q2467444) (← links)
- A Batch Scheduling Problem with Two Agents (Q2788524) (← links)
- JUST-IN-TIME SCHEDULING UNDER SCENARIO-BASED UNCERTAINTY (Q2836525) (← links)
- OUTSOURCING DECISIONS IN m-MACHINE PERMUTATION FLOW SHOP SCHEDULING PROBLEMS WITH MACHINE-DEPENDENT PROCESSING TIMES (Q2931728) (← links)
- Minimizing the total weighted delivery time in container transportation scheduling (Q3120557) (← links)
- Min-Max Regret Version of the Linear Time–Cost Tradeoff Problem with Multiple Milestones and Completely Ordered Jobs (Q3455883) (← links)
- Two-Server Network Disconnection Problem (Q3600164) (← links)
- Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals (Q4561184) (← links)
- A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work (Q5024913) (← links)
- A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph (Q5024918) (← links)
- Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates (Q5216799) (← links)
- Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures (Q5359060) (← links)
- Approximability of the <i>k</i>‐server disconnection problem (Q5434594) (← links)
- Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds (Q5478829) (← links)
- An Ordered Flow Shop with Two Agents (Q5506757) (← links)
- A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work (Q6054012) (← links)
- Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty (Q6094564) (← links)
- Two-machine flow shop scheduling with convex resource consumption functions (Q6097489) (← links)
