This page has only limited features, please log in for full access.

Unclaimed
Zhanguo Zhu
College of Economics and Management, Nanjing Agricultural University, Nanjing, 210095, P.R. China

Basic Info

Basic Info is private.

Honors and Awards

The user has no records in this section


Career Timeline

The user has no records in this section.


Short Biography

The user biography is not available.
Following
Followers
Co Authors
The list of users this user is following is empty.
Following: 0 users

Feed

Journal article
Published: 11 January 2019 in Computers & Operations Research
Reads 0
Downloads 0

In this paper, we deal with a disassembly line balancing problem (DLBP), using an AND/OR graph (AOG) to represent the precedence relations between tasks. The decision maker needs to select a proper processing alternative and assign the corresponding tasks among stations to minimise the number of stations, without violating the cycle time constraint and the precedence relations. The problem was first formulated by Koc et al. (2009) and is denoted as type 1 simple DLBP (SDLBP-1) in this study. We prove that an SDLBP-1 with no parallel tasks is polynomially solvable and develop a branch, bound, and remember (BB&R) algorithm for the general SDLBP-1 with parallel tasks. Moreover, two lower bounding schemes, a strengthened Koc's integer programming (IP) model and a new benchmark instance generation scheme are proposed. Computational results show that the BB&R algorithm is the state-of-the-art exact algorithm for SDLBP-1, and that it can be easily truncated into a state-of-the-art heuristic which optimally solves most instances in very short time. In addition, the lower bounds and the strengthened IP model are also demonstrated to be effective.

ACS Style

Jinlin Li; Xiaohong Chen; Zhanguo Zhu; Caijun Yang; Chengbin Chu. A branch, bound, and remember algorithm for the simple disassembly line balancing problem. Computers & Operations Research 2019, 105, 47 -57.

AMA Style

Jinlin Li, Xiaohong Chen, Zhanguo Zhu, Caijun Yang, Chengbin Chu. A branch, bound, and remember algorithm for the simple disassembly line balancing problem. Computers & Operations Research. 2019; 105 ():47-57.

Chicago/Turabian Style

Jinlin Li; Xiaohong Chen; Zhanguo Zhu; Caijun Yang; Chengbin Chu. 2019. "A branch, bound, and remember algorithm for the simple disassembly line balancing problem." Computers & Operations Research 105, no. : 47-57.

Journal article
Published: 04 April 2017 in Sustainability
Reads 0
Downloads 0

We analyze the organic and non-organic production choices of two firms by considering customers’ trust in organic food products. In the context of customers’ possible willingness to pay a premium price and their mistrust in organic food products, two firms first make choices on offering organic and non-organic food products. If offering organic products, a firm can further invest in the credence system to increase customers’ trust in their organic products. At the final stage, two firms determine prices. We provide serval insights. First, we characterize the market conditions in which only one firm, both firms or neither firm will choose to offer organic food products. We find that the higher the production costs or credence investment costs for organic food products are, the more likely firms are to choose to produce non-organic food products. Second, if it is expensive enough to invest in organic credence, offering organic food products may still be uncompetitive, even if organic production cost appears to have no disadvantage compared to non-organic food products. Third, we highlight how the prices of organic food products in equilibrium are affected by market parameters. We show that when only one firm offers organic food products, this firm tends to offer a relatively low price if organic credence investment is expensive. Fourth, we highlight how one firm’s credence investment decision in equilibrium can be affected by the product type choice of the other firm. We find that the investment in organic credence is lower when both firms offer organic food products compared with the case when only one firm offers organic food products.

ACS Style

Yi Wang; Zhanguo Zhu; Feng Chu. Organic vs. Non-Organic Food Products: Credence and Price Competition. Sustainability 2017, 9, 545 .

AMA Style

Yi Wang, Zhanguo Zhu, Feng Chu. Organic vs. Non-Organic Food Products: Credence and Price Competition. Sustainability. 2017; 9 (4):545.

Chicago/Turabian Style

Yi Wang; Zhanguo Zhu; Feng Chu. 2017. "Organic vs. Non-Organic Food Products: Credence and Price Competition." Sustainability 9, no. 4: 545.

Journal article
Published: 15 July 2016 in International Journal of Production Research
Reads 0
Downloads 0

Motivated by the behavioral phenomena that occur while human operators are carrying out tasks, we study multitasking scheduling problems with a rate-modifying activity. In the problems, the processing of a selected task suffers from interruptions by other tasks that are available but unfinished, and the human operators regularly engage rest breaks during work shifts allowing them to recover or mitigate some of the negative effects of fatigue. The objectives are to respectively minimize: makespan, total completion time, maximum lateness, and due-date assignment related cost by determining when to schedule the rate modifying activity and the optimal task sequence in the presence of multitasking. Scheduling models and algorithms are proposed to solve the problems. The numerical examples are presented to illustrate the theorems and algorithms.

ACS Style

Zhanguo Zhu; FeiFeng Zheng; Chengbin Chu. Multitasking scheduling problems with a rate-modifying activity. International Journal of Production Research 2016, 55, 296 -312.

AMA Style

Zhanguo Zhu, FeiFeng Zheng, Chengbin Chu. Multitasking scheduling problems with a rate-modifying activity. International Journal of Production Research. 2016; 55 (1):296-312.

Chicago/Turabian Style

Zhanguo Zhu; FeiFeng Zheng; Chengbin Chu. 2016. "Multitasking scheduling problems with a rate-modifying activity." International Journal of Production Research 55, no. 1: 296-312.