T. C. E. Cheng

Affiliations:
  • Hong Kong Polytechnic University, Hong Kong


According to our database1, T. C. E. Cheng authored at least 439 papers between 1986 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Opaque or Transparent: Quality Disclosure Strategy for Accommodation-Sharing Platforms.
J. Theor. Appl. Electron. Commer. Res., 2022

High-contact services of the transient and high-uncertainty type: managing customer experience.
Ind. Manag. Data Syst., 2022

For whom does flow not enhance online gamer loyalty?
Ind. Manag. Data Syst., 2022

Coordinating supply chains with uncertain production cost by incomplete contracts.
Int. J. Prod. Res., 2022

How does media richness foster online gamer loyalty?
Int. J. Inf. Manag., 2022

Bounds for two multicolor Ramsey numbers concerning quadrilaterals.
Finite Fields Their Appl., 2022

Lead-time quotation and hedging coordination in make-to-order supply chain.
Eur. J. Oper. Res., 2022

Production/inventory competition between firms with fixed-proportions co-production systems.
Eur. J. Oper. Res., 2022

A Study on Operational Risk and Credit Portfolio Risk Estimation Using Data Analytics.
Decis. Sci., 2022

Cooperative Promotion of Cross-Market Firms Adopting 3D Printing Technology.
Asia Pac. J. Oper. Res., 2022

2021
Overcoming the Service Paradox by Leveraging Organizational Design and Cultural Factors: A Combined Configuration and Contingency Approach.
IEEE Trans. Engineering Management, 2021

Pan-sharpening based on multi-objective decision for multi-band remote sensing images.
Pattern Recognit., 2021

A note on competing-agent Pareto-scheduling.
Optim. Lett., 2021

Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences.
J. Oper. Res. Soc., 2021

Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work.
J. Comb. Optim., 2021

A cluster-based intelligence ensemble learning method for classification problems.
Inf. Sci., 2021

A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants.
INFORMS J. Comput., 2021

Improving the effectiveness of social media-based crowdsourcing innovations: roles of assurance mechanism and innovator's behaviour.
Ind. Manag. Data Syst., 2021

Impact of workplace frustration on online gamer loyalty.
Ind. Manag. Data Syst., 2021

The impact of business intelligence systems on profitability and risks of firms.
Int. J. Prod. Res., 2021

Multi-agent scheduling problems under multitasking.
Int. J. Prod. Res., 2021

Inventory management and the value of quick response to the retailer facing boundedly rational strategic customers.
Int. J. Prod. Res., 2021

Production scheduling with autonomous and induced learning.
Int. J. Prod. Res., 2021

Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion.
Eur. J. Oper. Res., 2021

A meta-heuristic to solve the just-in-time job-shop scheduling problem.
Eur. J. Oper. Res., 2021

Four decades of research on the open-shop scheduling problem to minimize the makespan.
Eur. J. Oper. Res., 2021

Not all qualities are equal: Moderating role of online shopper conscientiousness in quality evaluation.
Electron. Commer. Res. Appl., 2021

Impact of online gamers' conscientiousness on team function engagement and loyalty.
Decis. Support Syst., 2021

IT Outsourcing and Vendor Cost Improvement Strategies under Asymmetric Information.
Decis. Sci., 2021

Degree sums and dominating cycles.
Discret. Math., 2021

Order assignment and picking station scheduling for multiple stations in KIVA warehouses.
CoRR, 2021

Joint optimization of order sequencing and rack scheduling in the robotic mobile fulfilment system.
Comput. Oper. Res., 2021

Effects of imperfect IoT-enabled diagnostics on maintenance services: A system design perspective.
Comput. Ind. Eng., 2021

Effect of free-riding behavior on vaccination coverage with customer regret.
Comput. Ind. Eng., 2021

A note on scheduling on two identical machines with early work maximization.
Comput. Ind. Eng., 2021

Casualty transport scheduling considering survival probability and injury classification.
Comput. Ind. Eng., 2021

Bicriteria scheduling to minimize total late work and maximum tardiness with preemption.
Comput. Ind. Eng., 2021

A two-layer nested heterogeneous ensemble learning predictive method for COVID-19 mortality.
Appl. Soft Comput., 2021

Single-machine serial-batch delivery scheduling with two competing agents and due date assignment.
Ann. Oper. Res., 2021

Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm.
Ann. Oper. Res., 2021

Scheduling an autonomous robot searching for hidden targets.
Ann. Oper. Res., 2021

2020
Strategic Sourcing Under Supplier Development Investments.
IEEE Trans. Engineering Management, 2020

Impact of gaming habits on motivation to attain gaming goals, perceived price fairness, and online gamer loyalty: Perspective of consistency principle.
Telematics Informatics, 2020

How do social networks foster online gamer loyalty? Perspective of weak/strong tie theory.
Telematics Informatics, 2020

A two-individual based path-relinking algorithm for the satellite broadcast scheduling problem.
Knowl. Based Syst., 2020

Bidding for outsourcing contracts with capacity investments and cost asymmetry.
J. Oper. Res. Soc., 2020

Why future friends matter: impact of expectancy of relational growth on online gamer loyalty.
Internet Res., 2020

The need for exercise in exergaming perspective of the uses and gratifications theory.
Ind. Manag. Data Syst., 2020

Impacts of media richness on network features and community commitment in online games.
Ind. Manag. Data Syst., 2020

How online gamers' participation fosters their team commitment: Perspective of social identity theory.
Int. J. Inf. Manag., 2020

Scheduling with release dates and preemption to minimize multiple max-form objective functions.
Eur. J. Oper. Res., 2020

Optimal production-inventory policy for the multi-period fixed proportions co-production system.
Eur. J. Oper. Res., 2020

Coupled task scheduling with exact delays: Literature review and models.
Eur. J. Oper. Res., 2020

Consumer Inter-Product Showrooming and Information Service Provision in an Omni-Channel Supply Chain.
Decis. Sci., 2020

Impacts of real-world need satisfaction on online gamer loyalty: Perspective of self-affirmation theory.
Comput. Hum. Behav., 2020

An <i>N</i>-Enterprise investment game under risk of domino accidents in a chemical cluster: Nash and pareto equilibria.
Comput. Chem. Eng., 2020

An integrated location-routing problem with post-disaster relief distribution.
Comput. Ind. Eng., 2020

A learning-based memetic algorithm for the multiple vehicle pickup and delivery problem with LIFO loading.
Comput. Ind. Eng., 2020

Scheduling step-deteriorating jobs to minimize the total completion time.
Comput. Ind. Eng., 2020

Cold chain distribution: How to deal with node and arc time windows?
Ann. Oper. Res., 2020

The integrated berth allocation, quay crane assignment and scheduling problem: mathematical formulations and a case study.
Ann. Oper. Res., 2020

Single Bounded Parallel-Batch Machine Scheduling with an Unavailability Constraint and Job Delivery.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019
The single-item lot-sizing problem with two production modes, inventory bounds, and periodic carbon emissions capacity.
Oper. Res. Lett., 2019

Optimal online algorithms for MapReduce scheduling on two uniform machines.
Optim. Lett., 2019

Two-machine hybrid flowshop scheduling with identical jobs: Solution algorithms and analysis of hybrid benefits.
J. Oper. Res. Soc., 2019

RFID investment strategy for fresh food supply chains.
J. Oper. Res. Soc., 2019

How do avatar attractiveness and customization impact online gamers' flow and loyalty?
Internet Res., 2019

Media richness, social presence and loyalty to mobile instant messaging.
Ind. Manag. Data Syst., 2019

Optimisation of online retailer pricing and carrier capacity expansion during low-price promotions with coordination of a decentralised supply chain.
Int. J. Prod. Res., 2019

Optimal purchase and selling strategy for wholesaler of produce: sorted or unsorted selling?
Int. J. Prod. Res., 2019

Multitasking parallel-machine scheduling with machine-dependent slack due-window assignment.
Int. J. Prod. Res., 2019

Should firms invest in social commerce? An integrative perspective.
Inf. Manag., 2019

A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan.
Eur. J. Oper. Res., 2019

On three color Ramsey numbers R(C4, C4, K1, n).
Discret. Math., 2019

Integrated production and multiple trips vehicle routing with time windows and uncertain travel times.
Comput. Oper. Res., 2019

Efficient Multi-Attribute Auctions Considering Supply Disruption.
Asia Pac. J. Oper. Res., 2019

Optimal Deployment of Charging Piles for Electric Vehicles Under the Indirect Network Effects.
Asia Pac. J. Oper. Res., 2019

How Do Workplace Frustration and Need Satisfaction Motivate Online Gamer Loyalty?
Proceedings of the 23rd Pacific Asia Conference on Information Systems, 2019

2018
Pricing and Benefit of Decentralization for Competing Supply Chains With Fixed Costs.
IEEE Trans. Engineering Management, 2018

Optimal Scheduling, Coordination, and the Value of RFID Technology in Garment Manufacturing Supply Chains.
IEEE Trans. Engineering Management, 2018

Enhancing customer loyalty to mobile instant messaging: Perspectives of network effect and self-determination theories.
Telematics Informatics, 2018

Which Inspection Approach Is Better to Prevent Drug Fraud: Announced or Unannounced?
J. Syst. Sci. Complex., 2018

Bin packing game with a price of anarchy of 3/2.
J. Comb. Optim., 2018

How do avatar characteristics affect avatar friendliness and online gamer loyalty? Perspective of the theory of embodied cognition.
Internet Res., 2018

Optimal reservation pricing strategy for a fashion supply chain with forecast update and asymmetric cost information.
Int. J. Prod. Res., 2018

Single-machine scheduling and common due date assignment with potential machine disruption.
Int. J. Prod. Res., 2018

Quick response under strategic consumers with risk preference and decreasing valuation.
Int. J. Prod. Res., 2018

Impact of online gamers' personality traits on interdependence, network convergence, and continuance intention: Perspective of social exchange theory.
Int. J. Inf. Manag., 2018

Quality disclosure strategies for small business enterprises in a competitive marketplace.
Eur. J. Oper. Res., 2018

Supply option contracts with spot market and demand information updating.
Eur. J. Oper. Res., 2018

Why and how do branders sell new products on flash sale platforms?
Eur. J. Oper. Res., 2018

Buy online and pick up in-store: Design of the service area.
Eur. J. Oper. Res., 2018

Quick Response in Supply Chains with Stochastically Risk Sensitive Retailers.
Decis. Sci., 2018

Advances in stochastic programming and robust optimization for supply chain planning.
Comput. Oper. Res., 2018

A Periodic Collaboration and Coexistence Management Model with the Oscillation Effect for Complex Mega Infrastructure Project under the Risk of Infection.
Complex., 2018

Who are likely to build strong online social networks? The perspectives of relational cohesion theory and personality theory.
Comput. Hum. Behav., 2018

Single-machine group scheduling with new models of position-dependent processing times.
Comput. Ind. Eng., 2018

A multi-criterion approach to optimal vaccination planning: Method and solution.
Comput. Ind. Eng., 2018

Logistics scheduling to minimize the sum of total weighted inventory cost and transport cost.
Comput. Ind. Eng., 2018

Preface.
Asia Pac. J. Oper. Res., 2018

Not All Are the Same: Facets of Conscientiousness, Competitive Virtual Team Functions, and Continuance Intention.
Proceedings of the 22nd Pacific Asia Conference on Information Systems, 2018

2017
Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs.
J. Sched., 2017

A combined approach for two-agent scheduling with sum-of-processing-times-based learning effect.
J. Oper. Res. Soc., 2017

Sequencing Games with Slack Due Windows and Group Technology Considerations.
J. Oper. Res. Soc., 2017

How does media richness contribute to customer loyalty to mobile instant messaging?
Internet Res., 2017

Demonstrating Johnson's algorithm via resource-constrained scheduling.
Int. J. Prod. Res., 2017

Some values of Ramsey numbers for C<sub>4</sub> versus stars.
Finite Fields Their Appl., 2017

Constraint-based and dedication-based mechanisms for encouraging online self-disclosure: Is personalization the only thing that matters?
Eur. J. Inf. Syst., 2017

Polarity graphs and Ramsey numbers for C<sub>4</sub> versus stars.
Discret. Math., 2017

A note on the time complexity of machine scheduling with DeJong's learning effect.
Comput. Ind. Eng., 2017

Multi-agent single-machine scheduling and unrestricted due date assignment with a fixed machine unavailability interval.
Comput. Ind. Eng., 2017

A hybrid evolutionary approach for the single-machine total weighted tardiness problem.
Comput. Ind. Eng., 2017

Particle swarm optimization and opposite-based particle swarm optimization for two-agent multi-facility customer order scheduling with ready times.
Appl. Soft Comput., 2017

Mean-risk analysis of wholesale price contracts with stochastic price-dependent demand.
Ann. Oper. Res., 2017

A Fast Algorithm for Detecting Hidden Objects by Smart Mobile Robots.
Proceedings of the 2017 IEEE International Conference on Smart Computing, 2017

2016
Improved Algorithms for Single-Machine Serial-Batch Scheduling With Rejection to Minimize Total Completion Time and Total Rejection Cost.
IEEE Trans. Syst. Man Cybern. Syst., 2016

The Effectiveness of Supply Chain Risk Information Processing Capability: An Information Processing Perspective.
IEEE Trans. Engineering Management, 2016

Bi-criterion single-machine scheduling and due-window assignment with common flow allowances and resource-dependent processing times.
J. Oper. Res. Soc., 2016

Economic design of X̅ control charts for monitoring batch manufacturing processes.
Int. J. Comput. Integr. Manuf., 2016

Rescheduling on identical parallel machines with machine disruptions to minimize total completion time.
Eur. J. Oper. Res., 2016

A mean-shift algorithm for large-scale planar maximal covering location problems.
Eur. J. Oper. Res., 2016

Evolutionary location and pricing strategies for service merchants in competitive O2O markets.
Eur. J. Oper. Res., 2016

Two-agent scheduling in a flowshop.
Eur. J. Oper. Res., 2016

An alternative approach for proving the NP-hardness of optimization problems.
Eur. J. Oper. Res., 2016

Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem.
Comput. Oper. Res., 2016

Two-agent single-machine scheduling to minimize the batch delivery cost.
Comput. Ind. Eng., 2016

Machine scheduling with deteriorating jobs and DeJong's learning effect.
Comput. Ind. Eng., 2016

Breakout dynasearch for the single-machine total weighted tardiness problem.
Comput. Ind. Eng., 2016

A hybrid evolutionary algorithm to solve the job shop scheduling problem.
Ann. Oper. Res., 2016

2015
Optimal Variety and Pricing Decisions of a Supply Chain With Economies of Scope.
IEEE Trans. Engineering Management, 2015

Competition Between Manufacturer's Online Customization Channel and Conventional Retailer.
IEEE Trans. Engineering Management, 2015

Single-machine batch scheduling with job processing time compatibility.
Theor. Comput. Sci., 2015

Single-machine batch scheduling of linear deteriorating jobs.
Theor. Comput. Sci., 2015

Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness.
J. Sched., 2015

Order acceptance and scheduling on two identical parallel machines.
J. Oper. Res. Soc., 2015

Single-machine common flow allowance scheduling with aging effect, resource allocation, and a rate-modifying activity.
Int. Trans. Oper. Res., 2015

Examining structural, perceptual, and attitudinal influences on the quality of information sharing in collaborative technology use.
Inf. Syst. Frontiers, 2015

Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines.
Inf. Process. Lett., 2015

Single-machine scheduling with time-dependent and position-dependent deteriorating jobs.
Int. J. Comput. Integr. Manuf., 2015

Equivalent circuit of external electromagnetic fields coupling to a transmission line above a lossy ground.
IEICE Electron. Express, 2015

Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling.
Comput. Oper. Res., 2015

A tabu search/path relinking algorithm to solve the job shop scheduling problem.
Comput. Oper. Res., 2015

Greening and performance relativity: An application in the shipping industry.
Comput. Oper. Res., 2015

Sustainable supply chain management: Advances in operations research perspective.
Comput. Oper. Res., 2015

Two-agent single-machine scheduling with unrestricted due date assignment.
Comput. Ind. Eng., 2015

Two-agent single-machine scheduling with deteriorating jobs.
Comput. Ind. Eng., 2015

Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time.
Comput. Ind. Eng., 2015

Single-machine scheduling with a variable maintenance activity.
Comput. Ind. Eng., 2015

Machine scheduling with DeJong's learning effect.
Comput. Ind. Eng., 2015

A Dual-Process Model to Assess User Attitudes and the Likelihood of Electronic Word-Of-Mouth Adoption.
Proceedings of the 19th Pacific Asia Conference on Information Systems, 2015

2014
Mean Variance Analysis of Fast Fashion Supply Chains With Returns Policy.
IEEE Trans. Syst. Man Cybern. Syst., 2014

Evolutionary Location and Pricing Strategies in Competitive Hierarchical Distribution Systems: A Spatial Agent-Based Model.
IEEE Trans. Syst. Man Cybern. Syst., 2014

Optimal algorithms for semi-online machine covering on two hierarchical machines.
Theor. Comput. Sci., 2014

Iterated Local Search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness.
J. Sched., 2014

Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan.
Optim. Lett., 2014

Single-machine scheduling with accelerating deterioration effects.
Optim. Lett., 2014

Scheduling with a position-weighted learning effect.
Optim. Lett., 2014

Multi-period empty container repositioning with stochastic demand and lost sales.
J. Oper. Res. Soc., 2014

Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time.
J. Oper. Res. Soc., 2014

A graph-theoretic approach to interval scheduling on dedicated unrelated parallel machines.
J. Oper. Res. Soc., 2014

Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost.
Inf. Sci., 2014

Buyback contracts with price-dependent demands: Effects of demand uncertainty.
Eur. J. Oper. Res., 2014

Product variety and channel structure strategy for a retailer-Stackelberg supply chain.
Eur. J. Oper. Res., 2014

Production planning and pricing policy in a make-to-stock system with uncertain demand subject to machine breakdowns.
Eur. J. Oper. Res., 2014

Make-or-buy service capacity decision in a supply chain providing after-sales service.
Eur. J. Oper. Res., 2014

The planar Ramsey number PR(C<sub>4</sub>, K<sub>8</sub>).
Discret. Appl. Math., 2014

Efficient computation of evacuation routes on a three-dimensional geometric network.
Comput. Ind. Eng., 2014

Group scheduling and job-dependent due window assignment based on a common flow allowance.
Comput. Ind. Eng., 2014

Two-agent single-machine scheduling to minimize the weighted sum of the agents' objective functions.
Comput. Ind. Eng., 2014

A memetic algorithm for the re-entrant permutation flowshop scheduling problem to minimize the makespan.
Appl. Soft Comput., 2014

2013
Developing an Organization Design Framework and Sample Based on the Total Relationship Flow Management Theorems.
IEEE Trans. Syst. Man Cybern. Syst., 2013

A note on reverse scheduling with maximum lateness objective.
J. Sched., 2013

Bounded parallel-batching scheduling with two competing agents.
J. Sched., 2013

Efficient Routing of Mobile Agents in a Stochastic Network.
Polibits, 2013

An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan.
Oper. Res. Lett., 2013

Four single-machine scheduling problems involving due date determination decisions.
Inf. Sci., 2013

Scheduling with a position-weighted learning effect based on sum-of-logarithm-processing-times and job position.
Inf. Sci., 2013

Market competitiveness and quality performance in high-contact service industries.
Ind. Manag. Data Syst., 2013

Informational and Relational Influences on Electronic Word of Mouth: An Empirical Study of an Online Consumer Discussion Forum.
Int. J. Electron. Commer., 2013

Coordination of supply chains with bidirectional option contracts.
Eur. J. Oper. Res., 2013

Quality uncertainty and quality-compensation contract for supply chain coordination.
Eur. J. Oper. Res., 2013

Single-machine common due window assignment and scheduling to minimize the total cost.
Discret. Optim., 2013

Two-agent singe-machine scheduling with release times to minimize the total weighted completion time.
Comput. Oper. Res., 2013

Single-machine batch delivery scheduling with an assignable common due date and controllable processing times.
Comput. Ind. Eng., 2013

Sports tournament scheduling to determine the required number of venues subject to the minimum timeslots under given formats.
Comput. Ind. Eng., 2013

A minimum-cost network flow approach to preemptive parallel-machine scheduling.
Comput. Ind. Eng., 2013

Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity.
Comput. Ind. Eng., 2013

2012
Impacts of Minimum Order Quantity on a Quick Response Supply Chain.
IEEE Trans. Syst. Man Cybern. Part A, 2012

Several semi-online scheduling problems on two identical machines with combined information.
Theor. Comput. Sci., 2012

Optimal Policy for Inventory Transfer Between Two Depots With Backlogging.
IEEE Trans. Autom. Control., 2012

Algorithms better than LPT for semi-online scheduling with decreasing processing times.
Oper. Res. Lett., 2012

Minimizing makespan in a two-machine flow shop with effects of deterioration and learning.
Optim. Lett., 2012

Value of Information Integration to Supply Chain Management: Roles of Internal and External Contingencies.
J. Manag. Inf. Syst., 2012

Optimal order lot sizing and pricing with free shipping.
Eur. J. Oper. Res., 2012

A theorem on cycle-wheel Ramsey number.
Discret. Math., 2012

An improved on-line algorithm for single parallel-batch machine scheduling with delivery times.
Discret. Appl. Math., 2012

Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities.
Comput. Oper. Res., 2012

Resource-constrained flowshop scheduling with separate resource recycling operations.
Comput. Oper. Res., 2012

A Self-guided Genetic Algorithm for permutation flowshop scheduling problems.
Comput. Oper. Res., 2012

Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost.
Comput. Ind. Eng., 2012

Performance bound analysis of a heuristic for the total weighted flowtime problem with fixed delivery dates.
Comput. Ind. Eng., 2012

Preemptive repayment policy for multiple loans.
Ann. Oper. Res., 2012

Two-agent single-machine scheduling with assignable due dates.
Appl. Math. Comput., 2012

2011
Online scheduling on unbounded parallel-batch machines with incompatible job families.
Theor. Comput. Sci., 2011

Semi-online scheduling with known partial information about job sizes on two identical machines.
Theor. Comput. Sci., 2011

Production and Inventory Rationing in a Make-to-Stock System With a Failure-Prone Machine and Lost Sales.
IEEE Trans. Autom. Control., 2011

A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan.
J. Sched., 2011

Behind the Iron Cage: An Institutional Perspective on ISO 9000 Adoption and CEO Compensation.
Organ. Sci., 2011

An Improved FPTAS for Mobile Agent Routing with Time Constraints.
J. Univers. Comput. Sci., 2011

Multi-facility ordered median problems in directed networks.
J. Syst. Sci. Complex., 2011

Berth and quay crane allocation: a moldable task scheduling model.
J. Oper. Res. Soc., 2011

Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time.
Inf. Sci., 2011

An Erratum on the Multiproduct Network Equilibrium Model.
Oper. Res., 2011

Optimal production strategy under demand fluctuations: Technology versus capacity.
Eur. J. Oper. Res., 2011

Two-agent scheduling to minimize the total cost.
Eur. J. Oper. Res., 2011

Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan.
Eur. J. Oper. Res., 2011

Best semi-online algorithms for unbounded parallel batch scheduling.
Discret. Appl. Math., 2011

A closed-form solution for the optimal release times for the F2 deteriorating jobs ∑w<sub>j</sub>C<sub>j</sub> problem.
Discret. Appl. Math., 2011

Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness.
Comput. Oper. Res., 2011

Flowshop scheduling of deteriorating jobs on dominating machines.
Comput. Ind. Eng., 2011

Two-machine flowshop scheduling with truncated learning to minimize the total completion time.
Comput. Ind. Eng., 2011

Unrelated parallel-machine scheduling with deteriorating maintenance activities.
Comput. Ind. Eng., 2011

A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations.
Comput. Ind. Eng., 2011

Coordinating a two-supplier and one-retailer supply chain with forecast updating.
Autom., 2011

Two-agent scheduling with position-based deteriorating jobs and learning effects.
Appl. Math. Comput., 2011

Computing Mobile Agent Routes with Node-Wise Constraints in Distributed Communication Systems.
Proceedings of the Advances in Artificial Intelligence, 2011

Efficient Routing of Mobile Agents for Agent-Based Integrated Enterprise Management: A General Acceleration Technique.
Proceedings of the Enterprise and Organizational Modeling and Simulation, 2011

2010
A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting.
Theor. Comput. Sci., 2010

Preemptive scheduling with simple linear deterioration on a single machine.
Theor. Comput. Sci., 2010

Optimal Scheduling of a Single-Supplier Single-Manufacturer Supply Chain With Common due Windows.
IEEE Trans. Autom. Control., 2010

On the complexity of bi-criteria scheduling on a single batch processing machine.
J. Sched., 2010

The loader problem: formulation, complexity and algorithms.
J. Oper. Res. Soc., 2010

Vector equilibrium flows with nonconvex ordering relations.
J. Glob. Optim., 2010

Scheduling with job-dependent learning effects and multiple rate-modifying activities.
Inf. Process. Lett., 2010

Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan.
Inf. Process. Lett., 2010

An Empirical Study of the Impact of Brand Name on Personal Customers' Adoption of Internet Banking in Hong Kong.
Int. J. E Bus. Res., 2010

An Empirical Study of Predicting Hong Kong Consumers' Online Shopping Intentions: Personal Hygiene Products.
Int. J. E Bus. Res., 2010

Coordination of supply chains by option contracts: A cooperative game theory approach.
Eur. J. Oper. Res., 2010

Evaluating the effects of distribution centres on the performance of vendor-managed inventory systems.
Eur. J. Oper. Res., 2010

A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure.
Eur. J. Oper. Res., 2010

"Product Partition" and related problems of scheduling and systems reliability: Computational complexity and approximation.
Eur. J. Oper. Res., 2010

Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan.
Eur. J. Oper. Res., 2010

Price and lead time decisions in dual-channel supply chains.
Eur. J. Oper. Res., 2010

The Ramsey numbers for cycles versus wheels of even order.
Eur. J. Comb., 2010

Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance.
Comput. Oper. Res., 2010

A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs.
Comput. Oper. Res., 2010

Machine scheduling with job class setup and delivery considerations.
Comput. Oper. Res., 2010

On scheduling unbounded batch processing machine(s).
Comput. Ind. Eng., 2010

Complexity of cyclic scheduling problems: A state-of-the-art survey.
Comput. Ind. Eng., 2010

Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan.
Comput. Ind. Eng., 2010

Scheduling problems with deteriorating jobs and learning effects including proportional setup times.
Comput. Ind. Eng., 2010

n-newsvendor biform game of trading capacity futures.
Proceedings of the Behavioral and Quantitative Game Theory, 2010

2009
Two semi-online scheduling problems on two uniform machines.
Theor. Comput. Sci., 2009

Parallel-machine scheduling of simple linear deteriorating jobs.
Theor. Comput. Sci., 2009

Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness.
Oper. Res. Lett., 2009

Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations.
Inf. Sci., 2009

Online scheduling on unbounded parallel-batch machines to minimize the makespan.
Inf. Process. Lett., 2009

An analytical study of the modification ability of distribution centers.
Eur. J. Oper. Res., 2009

Production scheduling with supply and delivery considerations to minimize the makespan.
Eur. J. Oper. Res., 2009

Johnson's rule, composite jobs and the relocation problem.
Eur. J. Oper. Res., 2009

The Ramsey numbers for Stars of odd Order versus a Wheel of Order nine.
Discret. Math. Algorithms Appl., 2009

Extreme values of the sum of squares of degrees of bipartite graphs.
Discret. Math., 2009

Codiameters of 3-domination critical graphs with toughness more than one.
Discret. Math., 2009

Upper bounds on the upper signed total domination number of graphs.
Discret. Appl. Math., 2009

The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications.
Discret. Appl. Math., 2009

Scheduling jobs with release dates on parallel batch processing machines.
Discret. Appl. Math., 2009

A polynomial-time algorithm for the paired-domination problem on permutation graphs.
Discret. Appl. Math., 2009

The Ramsey number for a cycle of length six versus a clique of order eight.
Discret. Appl. Math., 2009

Bounded single-machine parallel-batch scheduling with release dates and rejection.
Comput. Oper. Res., 2009

Bicriterion scheduling with equal processing times on a batch processing machine.
Comput. Oper. Res., 2009

Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times.
Comput. Oper. Res., 2009

A hybrid algorithm for the single-machine total tardiness problem.
Comput. Oper. Res., 2009

The role of perceived user-interface design in continued usage intention of self-paced e-learning tools.
Comput. Educ., 2009

Finite dominating sets for the multi-facility ordered median problem in networks and algorithmic applications.
Comput. Ind. Eng., 2009

The Ramsey numbers for cycles versus wheels of odd order.
Appl. Math. Lett., 2009

Two-Machine Flow-Shop Minimum-Length Scheduling with Interval Processing Times.
Asia Pac. J. Oper. Res., 2009

2008
Batch scheduling of step deteriorating jobs.
J. Sched., 2008

The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan.
Oper. Res. Lett., 2008

An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines.
Oper. Res. Lett., 2008

Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects.
Inf. Sci., 2008

An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan.
Inf. Process. Lett., 2008

The Driving Forces of Customer Loyalty: A Study of Internet Service Providers in Hong Kong.
Int. J. E Bus. Res., 2008

A coordination-theoretic investigation of the impact of electronic integration on logistics performance.
Inf. Manag., 2008

Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times.
Eur. J. Oper. Res., 2008

Parallel-machine scheduling with simple linear deterioration to minimize total completion time.
Eur. J. Oper. Res., 2008

Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time.
Eur. J. Oper. Res., 2008

Multi-agent scheduling on a single machine with max-form criteria.
Eur. J. Oper. Res., 2008

Batch scheduling of deteriorating reworkables.
Eur. J. Oper. Res., 2008

A survey of scheduling problems with setup times or costs.
Eur. J. Oper. Res., 2008

The Ramsey numbers R(C<sub>m</sub>, K<sub>7</sub>) and R(C<sub>7</sub>, K<sub>8</sub>).
Eur. J. Comb., 2008

Clique-transversal Number in Cubic Graphs.
Discret. Math. Theor. Comput. Sci., 2008

Remarks on the minus (signed) total domination in graphs.
Discret. Math., 2008

Heavy cycles in k-connected weighted graphs with large weighted degree sums.
Discret. Math., 2008

Hamilton-connectivity of 3-domination critical graphs with alpha=delta+1 >= 5.
Discret. Math., 2008

Group sequencing around a common due date.
Discret. Optim., 2008

An application of the Turán theorem to domination in graphs.
Discret. Appl. Math., 2008

Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint.
Comput. Oper. Res., 2008

Some scheduling problems with deteriorating jobs and learning effects.
Comput. Ind. Eng., 2008

2007
Scheduling jobs with agreeable processing times and due dates on a single batch processing machine.
Theor. Comput. Sci., 2007

Due-date assignment and parallel-machine scheduling with deteriorating jobs.
J. Oper. Res. Soc., 2007

Absorbant of generalized de Bruijn digraphs.
Inf. Process. Lett., 2007

An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan.
Inf. Process. Lett., 2007

The structural theory of general systems applied in management: the total relationship flow management theorems.
Int. J. Gen. Syst., 2007

Approximability of single machine scheduling with fixed jobs to minimize total completion time.
Eur. J. Oper. Res., 2007

NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time.
Eur. J. Oper. Res., 2007

Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan.
Eur. J. Oper. Res., 2007

Application of structural equation modeling to evaluate the intention of shippers to use Internet services in liner shipping.
Eur. J. Oper. Res., 2007

Fixed interval scheduling: Models, applications, computational complexity and algorithms.
Eur. J. Oper. Res., 2007

Batch delivery scheduling with batch delivery cost on a single machine.
Eur. J. Oper. Res., 2007

Mobile commerce integrated with RFID technology in a container depot.
Decis. Support Syst., 2007

The Ramsey numbers for a cycle of length six or seven versus a clique of order seven.
Discret. Math., 2007

Two-machine open shop problem with controllable processing times.
Discret. Optim., 2007

Paired domination on interval and circular-arc graphs.
Discret. Appl. Math., 2007

An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint.
Comput. Oper. Res., 2007

Heuristics for two-machine flowshop scheduling with setup times and an availability constraint.
Comput. Oper. Res., 2007

A simple linear time algorithm for scheduling with step-improving processing times.
Comput. Oper. Res., 2007

Single-machine scheduling with periodic maintenance to minimize makespan.
Comput. Oper. Res., 2007

An improved algorithm for the p-center problem on interval graphs with unit lengths.
Comput. Oper. Res., 2007

Intra-organizational perspectives on IT-enabled supply chains.
Commun. ACM, 2007

Scheduling Problems with the Effects of deterioration and Learning.
Asia Pac. J. Oper. Res., 2007

The algorithmic complexity of the minus clique-transversal problem.
Appl. Math. Comput., 2007

Heavy Cycles in 2-Connected Weighted Graphs with Large Weighted Degree Sums.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

Some New Structural Properties of Shortest 2-Connected Steiner Networks.
Proceedings of the Frontiers in Algorithmics, First Annual International Workshop, 2007

Clique-Transversal Sets in Cubic Graphs.
Proceedings of the Combinatorics, 2007

2006
Scheduling linear deteriorating jobs with an availability constraint on a single machine.
Theor. Comput. Sci., 2006

Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs.
Theor. Comput. Sci., 2006

Single machine batch scheduling problem with family setup times and release dates to minimize makespan.
J. Sched., 2006

An O(n<sup>2</sup>) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness.
J. Sched., 2006

Scheduling with step-improving processing times.
Oper. Res. Lett., 2006

Extending the Understanding of End User Information Systems Satisfaction Formation: An Equitable Needs Fulfillment Model Approach.
MIS Q., 2006

A note on the complexity of the problem of two-agent scheduling on a single machine.
J. Comb. Optim., 2006

Two-machine flowshop scheduling with conditional deteriorating second operations.
Int. Trans. Oper. Res., 2006

A new algorithm for online uniform-machine scheduling to minimize the makespan.
Inf. Process. Lett., 2006

A Multiproduct, Multicriterion Supply-Demand Network Equilibrium Model.
Oper. Res., 2006

Scheduling with controllable release dates and processing times: Total completion time minimization.
Eur. J. Oper. Res., 2006

Scheduling with controllable release dates and processing times: Makespan minimization.
Eur. J. Oper. Res., 2006

Adoption of internet banking: An empirical study in Hong Kong.
Decis. Support Syst., 2006

A note on acyclic domination number in graphs of diameter two.
Discret. Appl. Math., 2006

A heuristic approach for tow-machine no-wait flowshop scheduling with due dates and class setups.
Comput. Oper. Res., 2006

Institutional isomorphism and the adoption of information technology for supply chain management.
Comput. Ind., 2006

Minimizing total completion time in a two-machine flow shop with deteriorating jobs.
Appl. Math. Comput., 2006

2005
Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine.
Theor. Comput. Sci., 2005

Semi-on-line multiprocessor scheduling with given total processing time.
Theor. Comput. Sci., 2005

The impact of information sharing in a two-level supply chain with multiple retailers.
J. Oper. Res. Soc., 2005

Minimizing Completion Time Variance with Compressible Processing Times.
J. Glob. Optim., 2005

Single machine due-date scheduling of jobs with decreasing start-time dependent processing times.
Int. Trans. Oper. Res., 2005

Potential risks to e-commerce development using exploratory factor analysis.
Int. J. Serv. Technol. Manag., 2005

Conceptual Framework and Architecture for Agent-Oriented Knowledge Management Supported E-Learning Systems.
Int. J. Distance Educ. Technol., 2005

Single machine scheduling with resource dependent release times and processing times.
Eur. J. Oper. Res., 2005

On the single machine total tardiness problem.
Eur. J. Oper. Res., 2005

Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem.
Eur. J. Oper. Res., 2005

Single machine scheduling to minimize total weighted tardiness.
Eur. J. Oper. Res., 2005

Two-machine flowshop scheduling with job class setups to minimize total flowtime.
Comput. Oper. Res., 2005

Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times.
Comput. Oper. Res., 2005

A note on domination and minus domination numbers in cubic graphs.
Appl. Math. Lett., 2005

Preface.
Ann. Oper. Res., 2005

Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time.
Ann. Oper. Res., 2005

Two-Machine Flowshop Batching and Scheduling.
Ann. Oper. Res., 2005

Scheduling to Minimize Makespan with Time-Dependent Processing Times.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

An Implicit Weighted Degree Condition for Heavy Cycles in Weighted Graphs.
Proceedings of the Discrete Geometry, 2005

2004
From customer orientation to customer satisfaction: the gap between theory and practice.
IEEE Trans. Engineering Management, 2004

The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan.
Theor. Comput. Sci., 2004

Paired-domination in inflated graphs.
Theor. Comput. Sci., 2004

Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties.
J. Sched., 2004

Due-date assignment and single machine scheduling with deteriorating jobs.
J. Oper. Res. Soc., 2004

A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times.
Eur. J. Oper. Res., 2004

Single machine batch scheduling with jointly compressible setup and processing times.
Eur. J. Oper. Res., 2004

A concise survey of scheduling with time-dependent processing times.
Eur. J. Oper. Res., 2004

Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays.
Ann. Oper. Res., 2004

2003
Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs.
J. Sched., 2003

A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs.
J. Sched., 2003

The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard.
J. Sched., 2003

On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
Oper. Res. Lett., 2003

On scheduling an unbounded batch machine.
Oper. Res. Lett., 2003

Approximability of two-machine no-wait flowshop scheduling with availability constraints.
Oper. Res. Lett., 2003

Batch scheduling with controllable setup and processing times to minimize total completion time.
J. Oper. Res. Soc., 2003

Single Machine Scheduling of Unit-time Jobs with Controllable Release Dates.
J. Glob. Optim., 2003

3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints.
Inf. Process. Lett., 2003

Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
Eur. J. Oper. Res., 2003

Lower Bounds and Semi On-line Multiprocessor Scheduling.
Comput. Sci. J. Moldova, 2003

A strategic model for supply chain design with logical constraints: formulation and solution.
Comput. Oper. Res., 2003

Single machine scheduling with a variable common due date and resource-dependent processing times.
Comput. Oper. Res., 2003

Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine.
Comput. Oper. Res., 2003

Scheduling a Single Server in a Two-machine Flow Shop.
Computing, 2003

2002
A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints.
Oper. Res. Lett., 2002

Modelling the benefits of information sharing-based partnerships in a two-level supply chain.
J. Oper. Res. Soc., 2002

Scheduling start time dependent jobs to minimize the total weighted completion time.
J. Oper. Res. Soc., 2002

Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem.
Inf. Process. Lett., 2002

Three scheduling problems with deteriorating jobs to minimize the total completion time.
Inf. Process. Lett., 2002

Scheduling with job release dates, delivery times and preemption penalties.
Inf. Process. Lett., 2002

Applications of information support technologies for small and medium enterprises: a research agenda.
Int. J. Inf. Technol. Manag., 2002

An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note.
Comput. Oper. Res., 2002

Common due date assignment and scheduling with ready times.
Comput. Oper. Res., 2002

2001
An approximation algorithm for parallel machine scheduling with a common server.
J. Oper. Res. Soc., 2001

Heuristics for two-machine no-wait flowshop scheduling with an availability constraint.
Inf. Process. Lett., 2001

Benefits of information sharing with supply chain partnerships.
Ind. Manag. Data Syst., 2001

Single machine batch scheduling with resource dependent setup and processing times.
Eur. J. Oper. Res., 2001

Single machine scheduling with step-deteriorating processing times.
Eur. J. Oper. Res., 2001

Single-machine scheduling with a common due window.
Comput. Oper. Res., 2001

Batch scheduling in the no-wait two-machine flowshop to minimize the makespan.
Comput. Oper. Res., 2001

Minimizing Weighted Number of Early and Tardy Jobs with a Common Due Window Involving Location Penalty.
Ann. Oper. Res., 2001

Single Supplier Scheduling for Multiple Deliveries.
Ann. Oper. Res., 2001

2000
An improved heuristic for two-machine flowshop scheduling with an availability constraint.
Oper. Res. Lett., 2000

Response to Balkhi's response.
J. Oper. Res. Soc., 2000

A Reply to Balkhi.
J. Oper. Res. Soc., 2000

Single Machine Scheduling with Learning Effect Considerations.
Ann. Oper. Res., 2000

A permutation flow-shop scheduling problem with convex models of operation processing times.
Ann. Oper. Res., 2000

Single Machine Scheduling with Deadlines and Increasing Rates of Processing Times.
Acta Informatica, 2000

1999
MSS4TQM-a management support system for total quality management.
IEEE Trans. Syst. Man Cybern. Part C, 1999

A note on scheduling the two-machine flexible flowshop.
IEEE Trans. Robotics Autom., 1999

Scheduling Groups of Unit Length Jobs on Two Identical Parallel Machines.
Inf. Process. Lett., 1999

Two-Machine Flowshop Scheduling with Consecutive Availability Constraints.
Inf. Process. Lett., 1999

Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints.
Eur. J. Oper. Res., 1999

Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness.
Eur. J. Oper. Res., 1999

One-operator-two-machine flowshop scheduling with setup and dismounting times.
Comput. Oper. Res., 1999

The time dependent machine makespan problem is strongly NP-complete.
Comput. Oper. Res., 1999

Multiple-machine scheduling with earliness, tardiness and completion time penalties.
Comput. Oper. Res., 1999

1998
Bicriterion Single Machine Scheduling with Resource Dependent Processing Times.
SIAM J. Optim., 1998

A note on scheduling alternative operations in two-machine flowshops.
J. Oper. Res. Soc., 1998

Optimal production stopping and restarting times for an EOQ model with deteriorating items.
J. Oper. Res. Soc., 1998

The Complexity of Scheduling Starting Time Dependent Tasks with Release Times.
Inf. Process. Lett., 1998

Multi-machine Scheduling with Variance Minimization.
Discret. Appl. Math., 1998

1997
Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties.
SIAM J. Optim., 1997

Two-stage flowshop scheduling with a common second-stage machine.
Comput. Oper. Res., 1997

1996
Single-machine scheduling with trade-off between number of tardy jobs and resource allocation.
Oper. Res. Lett., 1996

Batch Scheduling and Common Due-date Assignment on a Single Machine.
Discret. Appl. Math., 1996

1995
Single machine batch scheduling with deadlines and resource dependent processing times.
Oper. Res. Lett., 1995

Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs.
Comput. Oper. Res., 1995

1994
Resource optimal control in some single-machine scheduling problems.
IEEE Trans. Autom. Control., 1994

Parallel Machine Scheduling with Batch Setup Times.
Oper. Res., 1994

One-machine batching and sequencing of multiple-type items.
Comput. Oper. Res., 1994

1993
A note on one-processor scheduling with asymmetric earliness and tardiness penalties.
Oper. Res. Lett., 1993

Parallel Machine Scheduling to Minimize Costs for Earliness and Number of Tardy Jobs.
Discret. Appl. Math., 1993

A Predictive and Reactive Scheduling Tool Kit for Repetitive Manufacturing.
Proceedings of the Knowledge-Based Reactive Scheduling, 1993

1990
A note on a proof of SPT optimality for singlemachine sequencing problems via the transportation problem.
Comput. Oper. Res., 1990

A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem.
Comput. Oper. Res., 1990

1988
Optimal common due-date with limited completion time deviation.
Comput. Oper. Res., 1988

1987
An algorithm for the con due-date determination and sequencing problem.
Comput. Oper. Res., 1987

1986
EOQ with limited backorder delays.
Comput. Oper. Res., 1986


  Loading...