Choi Byung-Cheon

Byung-Cheon Choi

Information about the author Byung-Cheon Choi will soon be added to the site.
Found 10 papers in total
Outsourcing and scheduling for two‐machine ordered flow shop scheduling problems
Outsourcing and scheduling for two‐machine ordered flow shop scheduling problems
2013
This paper considers a two‐machine ordered flow shop problem, where each job is...
Two‐stage proportionate flexible flow shop to minimize the makespan
Two‐stage proportionate flexible flow shop to minimize the makespan
2013
We consider a two‐stage flexible flow shop problem with a single machine at one...
Minimizing makespan in an ordered flow shop with machine‐dependent processing times
Minimizing makespan in an ordered flow shop with machine‐dependent processing times
2011
We consider a generalization of the proportionate flow shop problem with the makespan...
Two‐stage production scheduling with an outsourcing option
Two‐stage production scheduling with an outsourcing option
2011
This paper considers a two‐stage production scheduling problem in which each...
Two‐machine flow shop scheduling problem with an outsourcing option
Two‐machine flow shop scheduling problem with an outsourcing option
2011
We consider a two‐machine flow shop problem in which each job is processed...
Complexity of a scheduling problem with controllable processing times
Complexity of a scheduling problem with controllable processing times
2010
We consider the problem of scheduling a set of independent jobs on a single machine so...
Polynomiality of sparsest cuts with fixed number of sources
Polynomiality of sparsest cuts with fixed number of sources
2007
We show that when the number of sources is constant the sparsest cut problem is...
Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
2007
A flow shop with identical machines is called a proportionate flow shop. In this...
Maximizing the weighted number of just-in-time jobs in flow shop scheduling
Maximizing the weighted number of just-in-time jobs in flow shop scheduling
2007
In this paper we consider the maximization of the weighted number of just-in-time jobs...
Single machine scheduling problems with resource dependent release times
Single machine scheduling problems with resource dependent release times
2007
We consider two single machine scheduling problems with resource dependent release...
Papers per page: