Jen-Shiang Chen

According to our database, Jen-Shiang Chen authored at least 8 papers between 2001 and 2010.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2010

Scheduling multiple orders per job in a single machine to minimize total completion time.

Scott J. Mason, Jen-Shiang Chen

Eur. J. Oper. Res., 2010

2008

Hybrid tabu search for re-entrant permutation flow-shop scheduling problem.

Jen-Shiang Chen, Jason Chao-Hsien Pan, Chien-Kuang Wu

Expert Syst. Appl., 2008

A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem.

Jen-Shiang Chen, Jason Chao-Hsien Pan, Chien-Min Lin

Expert Syst. Appl., 2008

Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan.

Jen-Shiang Chen

Eur. J. Oper. Res., 2008

2005

Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling.

Jen-Shiang Chen, Jason Chao-Hsien Pan

Int. J. Syst. Sci., 2005

Mixed binary integer programming formulations for the reentrant job shop scheduling problem.

Jason Chao-Hsien Pan, Jen-Shiang Chen

Comput. Oper. Res., 2005

2002

Minimizing tardiness in a two-machine flow-shop.

Jason Chao-Hsien Pan, Jen-Shiang Chen, Chii-Ming Chao

Comput. Oper. Res., 2002

2001

A heuristic approach for single-machine scheduling with due dates and class setups.

Jason Chao-Hsien Pan, Jen-Shiang Chen, Hung-Liang Cheng

Comput. Oper. Res., 2001