A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date. - Chang Sup Sung; Un Gi Joo (Comput. Oper. Res., 1992)

Performance analysis of a queuing system with facilities requiring post-processing. - Chang Sup Sung; Myoung H. Park (Comput. Oper. Res., 1992)

Locating an obnoxious facility on a euclidean network to minimize neighborhood damage. - Chang Sup Sung; Cheol Min Joo (Networks, 1994)

An algorithm for configuring embedded networks in reconfigurable telecommunication networks. - Chang Sup Sung; Sung Ki Park (Telecommun. Syst., 1995)

A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines. - Chang Sup Sung; Young Hwan Kim; Sang Hum Yoon (Eur. J. Oper. Res., 2000)

A tabu-search-based heuristic for clustering. - Chang Sup Sung; Hyun Woong Jin (Pattern Recognit., 2000)

Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed. - Chang Sup Sung; Young Hwan Kim (Comput. Oper. Res., 2002)

Routing for a Multicommodity Traffic Problem with Transmission Delay and Load Balancing Considered. - Chang Sup Sung; Woosuk Yang (Communications in Computing, 2003)

Minimizing due date related performance measures on two batch processing machines. - Chang Sup Sung; Young Hwan Kim (Eur. J. Oper. Res., 2003)

Effective paging procedure for the optical feeder microcellular system. - Chang Sup Sung; Hyoun Chul Rim; Jung Sup Lee (IEEE Trans. Veh. Technol., 2003)

Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints. - Eun-Seok Kim; Chang Sup Sung; Ik-Sun Lee (Comput. Oper. Res., 2009)

Maximizing total job value on a single machine with job selection. - Joonyup Eun; Chang Sup Sung; Eun-Seok Kim (J. Oper. Res. Soc., 2017)