Byung-Cheon Choi

From MaRDI portal
Person:299835

Available identifiers

zbMath Open choi.byung-cheonMaRDI QIDQ299835

List of research outcomes

PublicationDate of PublicationType
A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work2023-10-24Paper
Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty2023-10-10Paper
Two-machine flow shop scheduling with convex resource consumption functions2023-06-05Paper
Single-machine scheduling with resource-dependent processing times and multiple unavailability periods2022-05-27Paper
A single machine scheduling with generalized and periodic due dates to minimize total deviation2022-04-20Paper
Scheduling with generalized and periodic due dates under single- and two-machine environments2022-03-15Paper
A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work2022-02-01Paper
A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph2022-02-01Paper
Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty2021-08-11Paper
A just-in-time scheduling problem with two competing agents2021-02-17Paper
Scheduling two projects with controllable processing times in a single-machine environment2020-12-11Paper
Two-machine flow shops with an optimal permutation schedule under a storage constraint2020-08-31Paper
Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates2020-02-20Paper
Strong NP-hardness of minimizing total deviation with generalized and periodic due dates2020-02-10Paper
A linear time-cost tradeoff problem with multiple milestones under a comb graph2019-06-25Paper
Minimizing the total weighted delivery time in container transportation scheduling2019-03-05Paper
Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals2018-12-10Paper
A single-machine scheduling problem with uncertainty in processing times and outsourcing costs2018-11-05Paper
Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks2018-05-29Paper
Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures2017-09-22Paper
An Ordered Flow Shop with Two Agents2016-12-16Paper
An adaptive crashing policy for stochastic time-cost tradeoff problems2016-11-17Paper
Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty2016-10-07Paper
A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs2016-10-06Paper
Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs2016-06-23Paper
A Batch Scheduling Problem with Two Agents2016-02-19Paper
Min-Max Regret Version of the Linear Time–Cost Tradeoff Problem with Multiple Milestones and Completely Ordered Jobs2015-12-11Paper
OUTSOURCING DECISIONS IN m-MACHINE PERMUTATION FLOW SHOP SCHEDULING PROBLEMS WITH MACHINE-DEPENDENT PROCESSING TIMES2014-11-26Paper
Outsourcing and scheduling for two-machine ordered flow shop scheduling problems2014-07-27Paper
Two-agent single-machine scheduling problem with just-in-time jobs2014-07-07Paper
JUST-IN-TIME SCHEDULING UNDER SCENARIO-BASED UNCERTAINTY2013-07-03Paper
Job release scheduling problem: complexity and an approximation algorithm2013-04-18Paper
Two-stage proportionate flexible flow shop to minimize the makespan2013-04-08Paper
A note on makespan minimization in proportionate flow shops2013-04-04Paper
Two-machine flow shop scheduling problem with an outsourcing option2012-05-14Paper
Minimizing makespan in an ordered flow shop with machine-dependent processing times2012-04-04Paper
A vector space approach to tag cloud similarity ranking2012-03-12Paper
Two-stage production scheduling with an outsourcing option2011-08-10Paper
Flow shops with machine maintenance: ordered and proportionate cases2010-09-09Paper
Complexity of single machine scheduling subject to nonnegative inventory constraints2010-09-09Paper
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time2010-08-20Paper
Complexity of a scheduling problem with controllable processing times2010-05-07Paper
Maximizing the weighted number of just-in-time jobs in flow shop scheduling2009-08-28Paper
Two-Server Network Disconnection Problem2009-02-10Paper
Polynomiality of sparsest cuts with fixed number of sources2008-01-21Paper
Approximability of the k‐server disconnection problem2008-01-07Paper
Single machine scheduling problem with controllable processing times and resource dependent release times2007-04-19Paper
Single machine scheduling problems with resource dependent release times2007-02-19Paper
Minimizing maximum completion time in a proportionate flow shop with one machine of different speed2006-11-15Paper
Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds2006-07-13Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Byung-Cheon Choi