Search

Although institutional theorists maintain that the widespread diffusion of ISO 9000 is the result of institutional forces, they have neglected the potential gains to top management in the perpetuation of [...]

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ejor.2010.05.017 Byline: Yingxue Zhao (a)(b), Shouyang Wang (a), T.C.E. Cheng (c), Xiaoqi Yang (d), Zhimin Huang (e)(f) Keywords: Supply chain management; Cooperative game; Option contract; Negotiating power; Channel coordination Abstract: Manufacturer-retailer supply chains commonly adopt a wholesale price mechanism. This mechanism, however, has often led manufacturers and retailers to situations of conflicts of interest. For example, due to uncertain market demand, retailers prefer to order flexibly from manufacturers so as to avoid incurring inventory costs and to be able to respond flexibly to market changes. Manufacturers, on the other hand, prefer retailers to place full orders as early as possible so that they can hedge against the risks of over- and under-production. Such conflicts between retailers and manufacturers can result in an inefficient supply chain. Motivated by this problem, we take a cooperative game approach in this paper to consider the coordination issue in a manufacturer-retailer supply chain using option contracts. Using the wholesale price mechanism as a benchmark, we develop an option contract model. Our study demonstrates that, compared with the benchmark based on the wholesale price mechanism, option contracts can coordinate the supply chain and achieve Pareto-improvement. We also discuss scenarios in which option contracts are selected according to individual supply chain members' risk preferences and negotiating powers. Author Affiliation: (a) Institute of Systems Science, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, PR China (b) School of International Trade and Economics, University of International Business and Economics, Beijing 100029, PR China (c) Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, PR China (d) Department of Applied Mathematics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, PR China (e) School of Business, Adelphi University, Garden City, NY 11530, USA (f) School of Business, Renmin University of China, Beijing 100872, PR China Article History: Received 27 May 2009; Accepted 13 May 2010

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ejor.2010.05.034 Byline: C.T. Ng (a), M.S. Barketau (b), T.C.E. Cheng (a), Mikhail Y. Kovalyov (b) Keywords: Complexity theory; Scheduling; Subset Product; FPTAS; Systems reliability Abstract: Problem Product Partition differs from the NP-complete problem Partition in that the addition operation is replaced by the multiplication operation. Furthermore it differs from the NP-complete problem Subset Product in that it does not contain the product value B in its input. We prove that problem Product Partition and several of its modifications are NP-complete in the strong sense. Our results imply the strong NP-hardness of a number of scheduling problems with start-time-dependent job processing times and a problem of designing a reliable system with a series-parallel structure. It should be noticed that the strong NP-hardness of the considered optimization problems does not preclude the existence of a fully polynomial time approximation scheme (FPTAS) for them. We present a simple FPTAS for one of these problems. Author Affiliation: (a) Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong (b) United Institute of Informatics Problems, National Academy of Sciences of Belarus, Surganova 6, 220012 Minsk, Belarus Article History: Received 23 September 2009; Accepted 19 May 2010

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ejor.2009.12.012 Byline: Guowei Hua (a)(c), Shouyang Wang (b), T.C.E. Cheng (c) Keywords: Supply chain management; Dual channel; Internet/direct marketing; E-commerce; Game theory Abstract: Manufacturers today are increasingly adopting a dual channel to sell their products, i.e., the traditional retail channel and an online direct channel. Empirical studies have shown that service quality (we focus on the delivery lead time of the direct channel) even goes beyond product price as one of the major factors influencing consumer acceptance of the direct channel. Delivery lead time has significant effects on demand, profit, and pricing strategy. However, there is scant literature addressing the decision on the promised delivery lead time of a direct channel and its impact on the manufacturer's and retailer's pricing decisions. To fill this gap, we examine the optimal decisions of delivery lead time and prices in a centralized and a decentralized dual-channel supply chain using the two-stage optimization technique and Stackelberg game, and analyze the impacts of delivery lead time and customer acceptance of a direct channel on the manufacturer's and retailer's pricing behaviours. We analytically show that delivery lead time strongly influences the manufacturer's and the retailer's pricing strategies and profits. Our numerical studies reveal that the difference between the demand transfer ratios in the two channels with respect to delivery lead time and direct sale price, customer acceptance of the direct channel, and product type have great effects on the lead time and pricing decisions. Author Affiliation: (a) School of Economics and Management, Beijing Jiaotong University, Beijing 100044, China (b) Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China (c) Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China Article History: Received 17 September 2008; Accepted 9 December 2009

In this paper we consider a new transportation model, called the loader problem, which is frequently encountered by third-party logistics service providers in practice. It is a tactical staff-planning problem with the objective of minimizing the total labour cost of staffing a sufficient number of loaders on a given fleet of trucks that serve a given set of customer sites. We formulate the problem as an integer program and show that it is strongly NP-hard. We then consider two special cases of the loader problem that occur in certain practical situations, and propose polynomial and pseudo-polynomial time algorithms for solving these cases. We also propose a linear programming relaxation-based random rounding algorithm for the general problem and report the computational results of the algorithm. Journal of the Operational Research Society (2010) 61, 840-848. doi: 10.1057/jors.2009.55 Published online 13 May 2009 Keywords: loader problem; integer programming; logistics: NP-hard; algorithms

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ejor.2009.05.021 Byline: Min Ji (a)(b), T.C.E. Cheng (b) Keywords: Batch scheduling; Makespan; Computational complexity; FPTAS Abstract: We consider a scheduling problem in which n jobs are to be processed on a single machine. The jobs are processed in batches and the processing time of each job is a simple linear function of its waiting time, i.e., the time between the start of the processing of the batch to which the job belongs and the start of the processing of the job. The objective is to minimize the makespan, i.e., the completion time of the last job. We first show that the problem is strongly NP-hard. Then we show that, if the number of batches is B, the problem remains strongly NP-hard when Ba[c]1/2U for a variable U[greater than or equal to]2 or B[greater than or equal to]U for any constant U[greater than or equal to]2. For the case of Ba[c]1/2U, we present a dynamic programming algorithm that runs in pseudo-polynomial time and a fully polynomial time approximation scheme (FPTAS) for any constant U[greater than or equal to]2. Furthermore, we provide an optimal linear time algorithm for the special case where the jobs are subject to a linear precedence constraint, which subsumes the case where all the job growth rates are equal. Author Affiliation: (a) College of Computer Science and Information Engineering, Zhejiang Gongshang University, Hangzhou 310018, PR China (b) Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong Kong Article History: Received 16 October 2008; Accepted 14 May 2009

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ejor.2009.02.006 Byline: L. Yang, C.T. Ng, T.C.E. Cheng Keywords: Distribution centre; Vendor-managed inventory system; Order-up-to-level policy; Location problem Abstract: This paper evaluates the effects of the distribution centre (DC) in a vendor-managed inventory (VMI) system comprising one manufacturer, one DC and n retailers. Adopting the order-up-to-level (OUL) replenishment policy, the system aims to maximize the overall system profit. We propose a model to evaluate the system performance by considering the scale of the distribution network, influential cost factors, demand distribution, planning horizon, and facility locations. From the viewpoint of a supply chain, we examine the DC's effects on the system in terms of net profit. Our findings reveal that the DC has effects on demand variance and system profit, and there are some dominant factors that affect the overall system performance. The DC may lead to different system performance under a variety of cost factors, and in some situations, the DC may negatively affect system performance. We also suggest some innovative uses of the DC's location to help enhance system performance. Author Affiliation: Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong Article History: Received 26 March 2008

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ejor.2009.01.040 Byline: C.T. Ng (a), Mikhail Y. Kovalyov (b), T.C.E. Cheng (a) Keywords: Capacitated economic lot-sizing problem; Fully polynomial time approximation scheme Abstract: The single-item capacitated economic lot-sizing (CELS) problem is a fundamental problem of production and inventory management. The first fully polynomial approximation scheme (FPTAS) for this problem with concave cost functions was developed by Van Hoesel and Wagelmans [C.P.M. Van Hoesel, A.P.M. Wagelmans, Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems, Mathematics of Operations Research 26 (2001) 339-357]. Chubanov et al. [S. Chubanov, M.Y. Kovalyov, E. Pesch, An FPTAS for a single-item capacitated economic lot-sizing problem, Mathematical Programming Series A 106 (2006) 453-466] later presented a sophisticated FPTAS for the general case of the CELS problem with a monotone cost structure. In this paper, we present a better FPTAS for this case. The ideas and presentation of our FPTAS are simple and straightforward. Its running time is about n.sup.4/I[micro].sup.2 times faster than that of Chubanov et al. [5], where n is the number of production periods and I[micro] is the anticipated relative error of the approximate solution. Author Affiliation: (a) Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong (b) Belarusian State University, and United Institute of Informatics Problems, National Academy of Sciences of Belarus, Nezavisimosti 4, 220030 Minsk, Belarus Article History: Received 10 January 2008; Accepted 22 January 2009

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ejor.2008.01.008 Byline: Qiu-Hong Zhao (a), T.C.E. Cheng (b) Keywords: Vendor managed inventory system; Distribution center; Modification ability; Order-up-to-level policy; Location Abstract: This paper considers a two-level vendor managed inventory (VMI) system comprising a distribution center (DC) and a retailer. Both the DC's and the retailer's replenishment decisions follow the order-up-to-level policy and aim at maximizing the profit of the overall system. We critically examine the potential of the DC's ability to modify delivery decisions, identify and quantify the cost factors that influence the DC's modification ability, establish a relationship between the DC's location and its modification ability, and show the trade-off between the DC's modification ability and related costs. Our analysis provides a new insight into the role of the DC and reveals the full potential of the VMI system. Our findings and their practical implications, demonstrated with the aid of computational examples, are helpful for enhancing the practice of VMI at both strategic and operational levels. Author Affiliation: (a) School of Economics and Management, Beihang University, Beijing 100083, China (b) Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong Article History: Received 31 January 2007; Accepted 7 January 2008

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ejor.2007.12.033 Byline: Xiuli Wang (a)(b), T.C.E. Cheng (b) Keywords: Scheduling; Supply and delivery; Heuristics; Performance bounds Abstract: In this paper we study a scheduling model that simultaneously considers production scheduling, material supply, and product delivery. One vehicle with limited loading capacity transports unprocessed jobs from the supplier's warehouse to the factory in a fixed travelling time. Another capacitated vehicle travels between the factory and the customer to deliver finished jobs to the customer. The objective is to minimize the arrival time of the last delivered job to the customer. We show that the problem is NP-hard in the strong sense, and propose an O(n) time heuristic with a tight performance bound of 2. We identify some polynomially solvable cases of the problem, and develop heuristics with better performance bounds for some special cases of the problem. Computational results show that all the heuristics are effective in producing optimal or near-optimal solutions quickly. Author Affiliation: (a) School of Economics and Management, Nanjing University of Science and Technology, Nanjing, China (b) Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong Article History: Received 2 March 2007; Accepted 27 December 2007

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ejor.2007.11.035 Byline: T.C.E. Cheng (a), B.M.T. Lin (b) Keywords: Flowshop; Makespan; Johnson's rule; Composite job; Relocation problem Abstract: Two-machine flowshop scheduling to minimize makespan is one of the most well-known classical scheduling problems. Johnson's rule for solving this problem has been widely cited in the literature. We introduce in this paper the concept of composite job, which is an artificially constructed job with processing times such that it will incur the same amount of idle time on the second machine as that incurred by a chain of jobs in a given processing sequence. This concept due to Kurisu first appeared in 1976 to deal with the two-machine flowshop scheduling problem involving precedence constraints among the jobs. We show that this concept can be applied to reduce the computational time to solve some related scheduling problems. We also establish a link between solving the two-machine flowshop makespan minimization problem using Johnson's rule and the relocation problem introduced by Kaplan. We present an intuitive interpretation of Johnson's rule in the context of the relocation problem. Author Affiliation: (a) Department of Logistics, The Hong Kong Polytechnic University, Kowloon, Hong Kong (b) Department of Information and Finance Management, Institute of Information Management, National Chiao Tung University, Hsinchu 300, Taiwan Article History: Received 26 April 2007; Accepted 5 November 2007

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ejor.2007.08.019 Byline: T.C.E. Cheng (a), C.T. Ng (a), J.J. Yuan (a)(b) Keywords: Scheduling; Single machine; Multi-operation jobs; Job-batch restriction; SPT-agreeability Abstract: We consider the problem of scheduling multi-operation jobs on a singe machine to minimize the total completion time. Each job consists of several operations that belong to different families. In a schedule each family of job operations may be processed as batches with each batch incurring a set-up time. A job is completed when all of its operations have been processed. We first show that the problem is strongly NP-hard even when the set-up times are common and each operation is not missing. When the operations have identical processing times and either the maximum set-up time is sufficiently small or the minimum set-up time is sufficiently large, the problem can be solved in polynomial time. We then consider the problem under the job-batch restriction in which the operations of each batch is partitioned into operation batches according to a partition of the jobs. We show that this case of the problem can be solved in polynomial time under a certain condition. Author Affiliation: (a) Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China (b) Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, People's Republic of China Article History: Received 6 April 2006; Accepted 20 August 2007

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ejor.2006.06.060 Byline: Ali Allahverdi (a), C.T. Ng (b), T.C.E. Cheng (b), Mikhail Y. Kovalyov (c) Keywords: Scheduling; Setup time; Setup cost; Survey (review); Single machine; Parallel machines; Flow shop; Job shop; Open shop Abstract: The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by [Allahverdi, A., Gupta, J.N.D., Aldowaisan, T., 1999. A review of scheduling research involving setup considerations. OMEGA The International Journal of Management Sciences 27, 219-239], who reviewed the literature since the mid-1960s. Since the appearance of that survey paper, there has been an increasing interest in scheduling problems with setup times (costs) with an average of more than 40 papers per year being added to the literature. The objective of this paper is to provide an extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers. Given that so many papers have appeared in a short time, there are cases where different researchers addressed the same problem independently, and sometimes by using even the same technique, e.g., genetic algorithm. Throughout the paper we identify such areas where independently developed techniques need to be compared. The paper classifies scheduling problems into those with batching and non-batching considerations, and with sequence-independent and sequence-dependent setup times. It further categorizes the literature according to shop environments, including single-machine, parallel machines, flow shop, no-wait flow shop, flexible flow shop, job shop, open shop, and others. Author Affiliation: (a) Department of Industrial and Management Systems Engineering, Kuwait University, P.O. Box 5969, Safat, Kuwait (b) Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong (c) Faculty of Economics, Belarusian State University, and United Institute of Informatics Problems, National Academy of Sciences of Belarus, Surganova 6, 220012 Minsk, Belarus Article History: Received 16 October 2005; Accepted 12 June 2006

Abstract We examine how the principles of quality management (QM) can be employed to ensure maritime security for liner shipping companies (LSCs), and emphasize the interface relationships between the regulatory [...]

In this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machines. Each job's processing time is a nondecreasing function of its start time. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of the due-date, earliness and tardiness penalties. We show that this problem is NP-hard, and we present a heuristic algorithm to find near-optimal solutions for the problem. When the due-date penalty is 0, we present a polynomial time algorithm to solve it. Keywords: deteriorating jobs; parallel-machine scheduling; due-date

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ejor.2006.05.001 Byline: Chin-Shan Lu (a), Kee-hung Lai (b), T.C.E. Cheng (b) Keywords: Internet services; Liner shipping; Structural equation model Abstract: Operations research (OR) is the application of modeling techniques to formulate and analyze systems and problems for management decision-making. Structural equation modeling (SEM) is a modeling technique applied to social or behavioral systems to understand and explain relationships that may exist among elements of systems. Recently, the measurement of unobservable variables has gained increasing attention in operations management (OM) research, and the OR discipline has begun to recognize the value of applying SEM to analyze behavioral-related OR problems. To provide OR researchers with a better understanding of the application of this useful statistical modeling technique, this paper presents a tutorial on the application of SEM. Specifically, we investigate the key factors that affect the adoption of Internet services in the context of liner shipping services. Although [Fishbein, M.A., Ajzen, I., 1975. Belief, Attitude, Intention and Behavior: An Introduction to Theory and Research, Addison-Wesley, Reading, MA; Davis, F.D., 1989. Perceived usefulness, perceived ease of use, and user acceptance of information technology. MIS Quarterly 13 (3), 319-339; Ajzen, I., 1985. From intention to actions: A theory of planned behavior. In: Kuhl, J., Bechmann, J. (Eds.), Action Control: From Cognition to Behavior. Springer Verlag, New York, pp. 11-39; Ajzen, I., 1991. The theory of planned behavior. Organizational Behavior and Human Decision Processes 50, 179-211] have made important contributions to understanding users' behavior of technology acceptance, shippers' resistance to end-user systems is still a common problem in the liner shipping industry. To better predict, explain, and increase shippers' acceptance of technology, we need to understand why shippers accept or reject Internet services provided by their liner shipping carriers. Another objective of this paper is to propose and empirically test a theoretical framework that relates the intention of shippers to use Internet services in liner shipping with its antecedents such as perceived usefulness, perceived ease of use, and the perceptions of security protection. Tests of the structural model confirm Davis's (1989) notion that perceived ease of use explains the intention of shippers to use Internet services, and that perceived ease of use has a strong positive effect on perceived usefulness. The results also indicate that security protection influences perceived ease of use. The SEM analyses in this study offer OR researchers a methodological guide on how to assess the efficacy of both a measurement model that relates observed indicators to latent factors and a structural model that poses relationships between constructs. Author Affiliation: (a) Department of Transportation and Communication Management Science, National Cheng Kung University, No. 1, University Road, Tainan City 701, Taiwan, ROC (b) Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong Article History: Received 5 March 2005; Accepted 2 May 2006

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ejor.2006.01.025 Byline: J.J. Yuan (a), Y.X. Lin (a), C.T. Ng (b), T.C.E. Cheng (b) Keywords: Scheduling; Single machine; Fixed jobs; Precedence constraints Abstract: We consider the single machine scheduling problem to minimize total completion time with fixed jobs, precedence constraints and release dates. There are some jobs that are already fixed in the schedule. The remaining jobs are free to be assigned to any free-time intervals on the machine in such a way that they do not overlap with the fixed jobs. Each free job has a release date, and the order of processing the free jobs is restricted by the given precedence constraints. The objective is to minimize the total completion time. This problem is strongly NP-hard. Approximability of this problem is studied in this paper. When the jobs are processed without preemption, we show that the problem has a linear-time n-approximation algorithm, but no pseudopolynomial-time (1- [delta])n-approximation algorithm exists even if all the release dates are zero, for any constant [delta] 0, if P[not equal to]NP, where n is the number of jobs; for the case that the jobs have no precedence constraints and no release dates, we show that the problem has no pseudopolynomial-time (2- [delta])-approximation algorithm, for any constant [delta] 0, if P[not equal to]NP, and for the weighted version, we show that the problem has no polynomial-time 2.sup.q(n)-approximation algorithm and no pseudopolynomial-time q(n)-approximation algorithm, where q(n) is any given polynomial of n. When preemption is allowed, we show that the problem with independent jobs can be solved in O(n log n) time with distinct release dates, but the weighted version is strongly NP-hard even with no release dates; the problems with weighted independent jobs or with jobs under precedence constraints are shown having polynomial-time n-approximation algorithms. We also establish the relationship of the approximability between the fixed job scheduling problem and the bin-packing problem. Author Affiliation: (a) Department of Mathematics, Zhengzhou University, Zhengzhou 450052, People's Republic of China (b) Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China Article History: Received 4 March 2005; Accepted 13 January 2006

The analysis of the approximability of the schedules of fixed jobs on a single machine in a flowshop, subject to precedence constraints, is presented.

This paper addresses a three-machine assembly-type flowshop scheduling problem, which frequently arises from manufacturing process management as well as from supply chain management. Machines one and two are arranged in parallel for producing component parts individually, and machine three is an assembly line arranged as the second stage of a flowshop for processing the component parts in batches. Whenever a batch is formed on the second-stage machine, a constant setup time is required. The objective is to minimize the makespan. In this study we establish the strong NP-hardness of the problem for the case where all the jobs have the same processing time on the second-stage machine. We then explore a useful property, based upon which a special case can be optimally solved in polynomial time. We also study several heuristic algorithms to generate quality approximate solutions for the general problem. Computational experiments are conducted to evaluate the effectiveness of the algorithms. Keywords: Two-stage flowshop; Batch scheduling; Makespan; NP-hardness; Heuristics, 1. Introduction In this paper we study an assembly-type production scheduling problem, which can be used to model the coordination of production scheduling between cooperative parties in a supply chain. [...]

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ejor.2005.09.006 Byline: Min Ji (a)(b)(c), Yong He (b), T.C.E. Cheng (c) Keywords: Single machine scheduling; Batch delivery cost; Optimal algorithm; Computational complexity Abstract: We consider a scheduling problem in which n independent and simultaneously available jobs are to be processed on a single machine. The jobs are delivered in batches and the delivery date of a batch equals the completion time of the last job in the batch. The delivery cost depends on the number of deliveries. The objective is to minimize the sum of the total weighted flow time and delivery cost. We first show that the problem is strongly NP-hard. Then we show that, if the number of batches is B, the problem remains strongly NP-hard when B a[c]1/2 U for a variable U [greater than or equal to]2 or B [greater than or equal to] U for any constant U [greater than or equal to]2. For the case of B a[c]1/2 U, we present a dynamic programming algorithm that runs in pseudo-polynomial time for any constant U [greater than or equal to]2. Furthermore, optimal algorithms are provided for two special cases: (i) jobs have a linear precedence constraint, and (ii) jobs satisfy the agreeable ratio assumption, which is valid, for example, when all the weights or all the processing times are equal. Author Affiliation: (a) College of Computer Science & Information Engineering, Zhejiang Gongshang University, Hangzhou 310035, PR China (b) Department of Mathematics, State Key Lab of CAD & CG, Zhejiang University, Hangzhou 310027, PR China (c) Department of Logistics, The Hong Kong Polytechnic University, Kowloon, Hong Kong Article History: Received 25 October 2004; Accepted 2 September 2005

Computational complexity of derivation of optimal algorithm for scheduling of jobs on single machine, based on batch delivery cost, in a manufacturing firm, is discussed.

Information sharing is an important component of cooperation in supply chain management. This paper presents a study to evaluate the impact of information sharing on inventory and expected cost in a two-level supply chain with multiple retailers. Three levels of information sharing are given and the optimal inventory policy under each level is derived. We show that both the inventory level and expected cost of the manufacturer decrease with an increase in the level of information sharing. Keywords: supply chain; information sharing; inventory

Abstract This article reports on the current state of information technology (IT) adoption in Hong Kong's logistics industry, identifies the benefits of and barriers to adopting IT, and provides recommendations [...]

Optimality properties of Lawler's pseudo-polynomial algorithm to examine single machine total tardiness problem are presented.

A heuristic approach, which examines the single machine scheduling problem with resource dependent release times and processing times, is presented.

The problems of completing a job in a batch on time using a single machine are examined. The methods that reduce the single machine, serial batching scheduling problem are presented.

The problem of batching and scheduling n identical jobs of F, F [greater than or equal to] 2, part types in a shop made up of F + 1 machines is studied. The processing of each job comprises two stages. The first stage is undertaken on the machine common to all jobs and the second stage is undertaken on the machine specific to a particular part type. Setup times are necessary at the first stage to switch processing from a job of one part type to a job of another part type. Jobs of the same part type processed contiguously at the first stage form a batch. The objective is to find a batch schedule minimizing makespan. We show that this problem is equivalent to a special case of a single machine family scheduling problem to minimize maximum lateness and therefore it can be solved in O([n.sup.F]) time by a known algorithm. Furthermore, for the case where F = 2, we present an iterative exact algorithm with O([k.sup.0] log L) running time, where [k.sup.0] is the maximum number of batches in a schedule created in any iteration of the algorithm and L is the problem input length in unary encoding. The algorithm finds a schedule with the minimum number of batches [k.sup.*] in any optimal solution. Computational experiments were conducted to investigate the relationship between [k.sup.*] and [k.sup.0]. For all tested examples, [k.sup.0] = max{[k.sup.*.sub.1], [k.sup.*.sub.2]}, where [k.sup.*.sub.1] ([k.sup.*.sub.2]) was the minimum number of batches in any optimal schedule starting with a batch of one part type (the other part type)., 1. Introduction The batch scheduling problem studied in this paper can be formulated as follows. A set of independent non-preemptive jobs each belonging to one of F, F [greater than [...]

This paper sets out to explore the quality initiatives of various industries and examine the links between quality management implementation and quality outcomes. We use the scenario in Hong Kong as a first step in addressing these research inquiries. Using Black and Porter's instrument (Decision Sci. 27 (1996) 1) and the various perceived performance measures representing quality management implementation and quality outcomes respectively, we conducted a mail survey to collect data from over 1000 companies with operational quality management systems and received 304 valid responses for data analysis. Analysis of variance (ANOVA) was used to analyze the data and the results are consistent with our prediction that the differences in quality initiatives by industry types affect the levels of quality management implementation and quality outcomes in different industries. In particular, we found that significant contrast exists between public utilities/service industries and manufacturing/construction industries, with the former group having a higher level of quality management implementation and achieving better quality outcomes. The emphases that they placed on their quality management implementation also seem to differ. Implications of the results are discussed and suggestions for further research on quality management and implementation are offerred. Keywords: Quality; Critical factors; Implementation; Industry comparisons; Performance, 1. Introduction One of the important decisions for a firm on the journey to quality concerns the extent to which quality management should be implemented. There are many studies on [...]

This paper considers a fabrication scheduling problem to minimize the makespan in a two-machine flowshop. Each job has a unique component and a common component to be processed on the first machine. On machine 1, the common components of the jobs are grouped into batches for processing with a setup cost incurred whenever a batch is formed. A job is ready for its assembly operation on the second machine if both its unique and common components are finished on machine 1. The problems with batch availability and item availability are known as NP-hard. In this paper, we give proofs for the strong NP-hardness of the two problems. The results suggest that it is very unlikely to develop polynomial- or pseudo-polynomial-time algorithm for finding exact solutions for the two problems., 1. Introduction In the last decade, batch scheduling problems have increasingly become a popular subject of study in scheduling research (Allahverdi et al., 1999; Cheng et al., 2000; Potts and [...]

A scheduling model with step-deteriorating processing times is presented with the flow time problem shown as NP-complete.