# T. C. Edwin Cheng

According to our database

^{1}, T. C. Edwin Cheng## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2017

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

J. Scheduling, 2017

A combined approach for two-agent scheduling with sum-of-processing-times-based learning effect.

JORS, 2017

Sequencing Games with Slack Due Windows and Group Technology Considerations.

JORS, 2017

How does media richness contribute to customer loyalty to mobile instant messaging?

Internet Research, 2017

Some values of Ramsey numbers for C

_{4}versus stars.
Finite Fields and Their Applications, 2017

Constraint-based and dedication-based mechanisms for encouraging online self-disclosure: Is personalization the only thing that matters?

EJIS, 2017

Polarity graphs and Ramsey numbers for C

_{4}versus stars.
Discrete Mathematics, 2017

Multi-agent single-machine scheduling and unrestricted due date assignment with a fixed machine unavailability interval.

Computers & Industrial Engineering, 2017

A hybrid evolutionary approach for the single-machine total weighted tardiness problem.

Computers & Industrial Engineering, 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

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. Systems, Man, and Cybernetics: Systems, 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.

JORS, 2016

Economic design of X̅ control charts for monitoring batch manufacturing processes.

Int. J. Computer Integrated Manufacturing, 2016

Rescheduling on identical parallel machines with machine disruptions to minimize total completion time.

European Journal of Operational Research, 2016

A mean-shift algorithm for large-scale planar maximal covering location problems.

European Journal of Operational Research, 2016

Evolutionary location and pricing strategies for service merchants in competitive O2O markets.

European Journal of Operational Research, 2016

Two-agent scheduling in a flowshop.

European Journal of Operational Research, 2016

An alternative approach for proving the NP-hardness of optimization problems.

European Journal of Operational Research, 2016

Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem.

Computers & OR, 2016

Two-agent single-machine scheduling to minimize the batch delivery cost.

Computers & Industrial Engineering, 2016

Machine scheduling with deteriorating jobs and DeJong's learning effect.

Computers & Industrial Engineering, 2016

Breakout dynasearch for the single-machine total weighted tardiness problem.

Computers & Industrial Engineering, 2016

A hybrid evolutionary algorithm to solve the job shop scheduling problem.

Annals OR, 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. Scheduling, 2015

Order acceptance and scheduling on two identical parallel machines.

JORS, 2015

Single-machine common flow allowance scheduling with aging effect, resource allocation, and a rate-modifying activity.

ITOR, 2015

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

Information Systems 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. Computer Integrated Manufacturing, 2015

Equivalent circuit of external electromagnetic fields coupling to a transmission line above a lossy ground.

IEICE Electronic Express, 2015

Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling.

Computers & OR, 2015

A tabu search/path relinking algorithm to solve the job shop scheduling problem.

Computers & OR, 2015

Greening and performance relativity: An application in the shipping industry.

Computers & OR, 2015

Sustainable supply chain management: Advances in operations research perspective.

Computers & OR, 2015

Two-agent single-machine scheduling with unrestricted due date assignment.

Computers & Industrial Engineering, 2015

Two-agent single-machine scheduling with deteriorating jobs.

Computers & Industrial Engineering, 2015

Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time.

Computers & Industrial Engineering, 2015

Single-machine scheduling with a variable maintenance activity.

Computers & Industrial Engineering, 2015

Machine scheduling with DeJong's learning effect.

Computers & Industrial Engineering, 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. Systems, Man, and Cybernetics: Systems, 2014

Evolutionary Location and Pricing Strategies in Competitive Hierarchical Distribution Systems: A Spatial Agent-Based Model.

IEEE Trans. Systems, Man, and Cybernetics: Systems, 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. Scheduling, 2014

Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan.

Optimization Letters, 2014

Single-machine scheduling with accelerating deterioration effects.

Optimization Letters, 2014

Scheduling with a position-weighted learning effect.

Optimization Letters, 2014

Multi-period empty container repositioning with stochastic demand and lost sales.

JORS, 2014

Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time.

JORS, 2014

A graph-theoretic approach to interval scheduling on dedicated unrelated parallel machines.

JORS, 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.

European Journal of Operational Research, 2014

Product variety and channel structure strategy for a retailer-Stackelberg supply chain.

European Journal of Operational Research, 2014

Production planning and pricing policy in a make-to-stock system with uncertain demand subject to machine breakdowns.

European Journal of Operational Research, 2014

Make-or-buy service capacity decision in a supply chain providing after-sales service.

European Journal of Operational Research, 2014

Discrete Applied Mathematics, 2014

A Tabu Search/Path Relinking Algorithm to Solve the Job Shop Scheduling Problem.

CoRR, 2014

Efficient computation of evacuation routes on a three-dimensional geometric network.

Computers & Industrial Engineering, 2014

Group scheduling and job-dependent due window assignment based on a common flow allowance.

Computers & Industrial Engineering, 2014

Two-agent single-machine scheduling to minimize the weighted sum of the agents' objective functions.

Computers & Industrial Engineering, 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. Systems, Man, and Cybernetics: Systems, 2013

A note on reverse scheduling with maximum lateness objective.

J. Scheduling, 2013

Bounded parallel-batching scheduling with two competing agents.

J. Scheduling, 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.

Industrial Management and Data Systems, 2013

Informational and Relational Influences on Electronic Word of Mouth: An Empirical Study of an Online Consumer Discussion Forum.

Int. J. Electronic Commerce, 2013

Coordination of supply chains with bidirectional option contracts.

European Journal of Operational Research, 2013

Quality uncertainty and quality-compensation contract for supply chain coordination.

European Journal of Operational Research, 2013

Single-machine common due window assignment and scheduling to minimize the total cost.

Discrete Optimization, 2013

Two-agent singe-machine scheduling with release times to minimize the total weighted completion time.

Computers & OR, 2013

Single-machine batch delivery scheduling with an assignable common due date and controllable processing times.

Computers & Industrial Engineering, 2013

Sports tournament scheduling to determine the required number of venues subject to the minimum timeslots under given formats.

Computers & Industrial Engineering, 2013

A minimum-cost network flow approach to preemptive parallel-machine scheduling.

Computers & Industrial Engineering, 2013

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

Computers & Industrial Engineering, 2013

2012

Impacts of Minimum Order Quantity on a Quick Response Supply Chain.

IEEE Trans. Systems, Man, and Cybernetics, 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. Automat. Contr., 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.

Optimization Letters, 2012

Value of Information Integration to Supply Chain Management: Roles of Internal and External Contingencies.

J. of Management Information Systems, 2012

Optimal order lot sizing and pricing with free shipping.

European Journal of Operational Research, 2012

A theorem on cycle-wheel Ramsey number.

Discrete Mathematics, 2012

An improved on-line algorithm for single parallel-batch machine scheduling with delivery times.

Discrete Applied Mathematics, 2012

Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities.

Computers & OR, 2012

Resource-constrained flowshop scheduling with separate resource recycling operations.

Computers & OR, 2012

A Self-guided Genetic Algorithm for permutation flowshop scheduling problems.

Computers & OR, 2012

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

Computers & Industrial Engineering, 2012

Performance bound analysis of a heuristic for the total weighted flowtime problem with fixed delivery dates.

Computers & Industrial Engineering, 2012

Preemptive repayment policy for multiple loans.

Annals OR, 2012

Two-agent single-machine scheduling with assignable due dates.

Applied Mathematics and Computation, 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. Automat. Contr., 2011

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

J. Scheduling, 2011

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

Organization Science, 2011

An Improved FPTAS for Mobile Agent Routing with Time Constraints.

J. UCS, 2011

Multi-facility ordered median problems in directed networks.

J. Systems Science & Complexity, 2011

Berth and quay crane allocation: a moldable task scheduling model.

JORS, 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.

Operations Research, 2011

Optimal production strategy under demand fluctuations: Technology versus capacity.

European Journal of Operational Research, 2011

Two-agent scheduling to minimize the total cost.

European Journal of Operational Research, 2011

Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan.

European Journal of Operational Research, 2011

Best semi-online algorithms for unbounded parallel batch scheduling.

Discrete Applied Mathematics, 2011

A closed-form solution for the optimal release times for the F2 deteriorating jobs ∑w

_{j}C_{j}problem.
Discrete Applied Mathematics, 2011

Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness.

Computers & OR, 2011

Flowshop scheduling of deteriorating jobs on dominating machines.

Computers & Industrial Engineering, 2011

Two-machine flowshop scheduling with truncated learning to minimize the total completion time.

Computers & Industrial Engineering, 2011

Unrelated parallel-machine scheduling with deteriorating maintenance activities.

Computers & Industrial Engineering, 2011

A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations.

Computers & Industrial Engineering, 2011

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

Automatica, 2011

Two-agent scheduling with position-based deteriorating jobs and learning effects.

Applied Mathematics and Computation, 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. Automat. Contr., 2010

On the complexity of bi-criteria scheduling on a single batch processing machine.

J. Scheduling, 2010

The loader problem: formulation, complexity and algorithms.

JORS, 2010

Vector equilibrium flows with nonconvex ordering relations.

J. Global Optimization, 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.

IJEBR, 2010

An Empirical Study of Predicting Hong Kong Consumers' Online Shopping Intentions: Personal Hygiene Products.

IJEBR, 2010

Coordination of supply chains by option contracts: A cooperative game theory approach.

European Journal of Operational Research, 2010

Evaluating the effects of distribution centres on the performance of vendor-managed inventory systems.

European Journal of Operational Research, 2010

A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure.

European Journal of Operational Research, 2010

"Product Partition" and related problems of scheduling and systems reliability: Computational complexity and approximation.

European Journal of Operational Research, 2010

Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan.

European Journal of Operational Research, 2010

Price and lead time decisions in dual-channel supply chains.

European Journal of Operational Research, 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.

Computers & OR, 2010

A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs.

Computers & OR, 2010

Machine scheduling with job class setup and delivery considerations.

Computers & OR, 2010

On scheduling unbounded batch processing machine(s).

Computers & Industrial Engineering, 2010

Complexity of cyclic scheduling problems: A state-of-the-art survey.

Computers & Industrial Engineering, 2010

Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan.

Computers & Industrial Engineering, 2010

Scheduling problems with deteriorating jobs and learning effects including proportional setup times.

Computers & Industrial Engineering, 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.

European Journal of Operational Research, 2009

Production scheduling with supply and delivery considerations to minimize the makespan.

European Journal of Operational Research, 2009

Johnson's rule, composite jobs and the relocation problem.

European Journal of Operational Research, 2009

The Ramsey numbers for Stars of odd Order versus a Wheel of Order nine.

Discrete Math., Alg. and Appl., 2009

Extreme values of the sum of squares of degrees of bipartite graphs.

Discrete Mathematics, 2009

Codiameters of 3-domination critical graphs with toughness more than one.

Discrete Mathematics, 2009

Upper bounds on the upper signed total domination number of graphs.

Discrete Applied Mathematics, 2009

The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications.

Discrete Applied Mathematics, 2009

Scheduling jobs with release dates on parallel batch processing machines.

Discrete Applied Mathematics, 2009

A polynomial-time algorithm for the paired-domination problem on permutation graphs.

Discrete Applied Mathematics, 2009

The Ramsey number for a cycle of length six versus a clique of order eight.

Discrete Applied Mathematics, 2009

Bounded single-machine parallel-batch scheduling with release dates and rejection.

Computers & OR, 2009

Bicriterion scheduling with equal processing times on a batch processing machine.

Computers & OR, 2009

Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times.

Computers & OR, 2009

A hybrid algorithm for the single-machine total tardiness problem.

Computers & OR, 2009

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

Computers & Education, 2009

Finite dominating sets for the multi-facility ordered median problem in networks and algorithmic applications.

Computers & Industrial Engineering, 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.

APJOR, 2009

2008

Batch scheduling of step deteriorating jobs.

J. Scheduling, 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.

IJEBR, 2008

A coordination-theoretic investigation of the impact of electronic integration on logistics performance.

Information & Management, 2008

Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times.

European Journal of Operational Research, 2008

Parallel-machine scheduling with simple linear deterioration to minimize total completion time.

European Journal of Operational Research, 2008

Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time.

European Journal of Operational Research, 2008

Multi-agent scheduling on a single machine with max-form criteria.

European Journal of Operational Research, 2008

Batch scheduling of deteriorating reworkables.

European Journal of Operational Research, 2008

A survey of scheduling problems with setup times or costs.

European Journal of Operational Research, 2008

Eur. J. Comb., 2008

Clique-transversal Number in Cubic Graphs.

Discrete Mathematics & Theoretical Computer Science, 2008

Remarks on the minus (signed) total domination in graphs.

Discrete Mathematics, 2008

Heavy cycles in k-connected weighted graphs with large weighted degree sums.

Discrete Mathematics, 2008

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

Discrete Mathematics, 2008

Group sequencing around a common due date.

Discrete Optimization, 2008

An application of the Turán theorem to domination in graphs.

Discrete Applied Mathematics, 2008

Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint.

Computers & OR, 2008

Some scheduling problems with deteriorating jobs and learning effects.

Computers & Industrial Engineering, 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.

JORS, 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. General Systems, 2007

Approximability of single machine scheduling with fixed jobs to minimize total completion time.

European Journal of Operational Research, 2007

NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time.

European Journal of Operational Research, 2007

Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan.

European Journal of Operational Research, 2007

Application of structural equation modeling to evaluate the intention of shippers to use Internet services in liner shipping.

European Journal of Operational Research, 2007

Fixed interval scheduling: Models, applications, computational complexity and algorithms.

European Journal of Operational Research, 2007

Batch delivery scheduling with batch delivery cost on a single machine.

European Journal of Operational Research, 2007

Mobile commerce integrated with RFID technology in a container depot.

Decision Support Systems, 2007

The Ramsey numbers for a cycle of length six or seven versus a clique of order seven.

Discrete Mathematics, 2007

Two-machine open shop problem with controllable processing times.

Discrete Optimization, 2007

Paired domination on interval and circular-arc graphs.

Discrete Applied Mathematics, 2007

An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint.

Computers & OR, 2007

Heuristics for two-machine flowshop scheduling with setup times and an availability constraint.

Computers & OR, 2007

A simple linear time algorithm for scheduling with step-improving processing times.

Computers & OR, 2007

Single-machine scheduling with periodic maintenance to minimize makespan.

Computers & OR, 2007

An improved algorithm for the p-center problem on interval graphs with unit lengths.

Computers & OR, 2007

Intra-organizational perspectives on IT-enabled supply chains.

Commun. ACM, 2007

Scheduling Problems with the Effects of deterioration and Learning.

APJOR, 2007

The algorithmic complexity of the minus clique-transversal problem.

Applied Mathematics and Computation, 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. Scheduling, 2006

An O(n

^{2}) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness.
J. Scheduling, 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 Quarterly, 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.

ITOR, 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.

Operations Research, 2006

Scheduling with controllable release dates and processing times: Total completion time minimization.

European Journal of Operational Research, 2006

Scheduling with controllable release dates and processing times: Makespan minimization.

European Journal of Operational Research, 2006

Adoption of internet banking: An empirical study in Hong Kong.

Decision Support Systems, 2006

A note on acyclic domination number in graphs of diameter two.

Discrete Applied Mathematics, 2006

A heuristic approach for tow-machine no-wait flowshop scheduling with due dates and class setups.

Computers & OR, 2006

Institutional isomorphism and the adoption of information technology for supply chain management.

Computers in Industry, 2006

Minimizing total completion time in a two-machine flow shop with deteriorating jobs.

Applied Mathematics and Computation, 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.

JORS, 2005

Minimizing Completion Time Variance with Compressible Processing Times.

J. Global Optimization, 2005

Potential risks to e-commerce development using exploratory factor analysis.

IJSTM, 2005

Conceptual Framework and Architecture for Agent-Oriented Knowledge Management Supported E-Learning Systems.

IJDET, 2005

Single machine scheduling with resource dependent release times and processing times.

European Journal of Operational Research, 2005

On the single machine total tardiness problem.

European Journal of Operational Research, 2005

Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem.

European Journal of Operational Research, 2005

Single machine scheduling to minimize total weighted tardiness.

European Journal of Operational Research, 2005

Two-machine flowshop scheduling with job class setups to minimize total flowtime.

Computers & OR, 2005

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

Computers & OR, 2005

A note on domination and minus domination numbers in cubic graphs.

Appl. Math. Lett., 2005

Preface.

Annals OR, 2005

Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time.

Annals OR, 2005

Two-Machine Flowshop Batching and Scheduling.

Annals OR, 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. Scheduling, 2004

Due-date assignment and single machine scheduling with deteriorating jobs.

JORS, 2004

A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times.

European Journal of Operational Research, 2004

Single machine batch scheduling with jointly compressible setup and processing times.

European Journal of Operational Research, 2004

A concise survey of scheduling with time-dependent processing times.

European Journal of Operational Research, 2004

Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays.

Annals OR, 2004

2003

Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs.

J. Scheduling, 2003

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

J. Scheduling, 2003

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

J. Scheduling, 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

Single Machine Scheduling of Unit-time Jobs with Controllable Release Dates.

J. Global Optimization, 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.

European Journal of Operational Research, 2003

Lower Bounds and Semi On-line Multiprocessor Scheduling.

The Computer Science Journal of Moldova, 2003

A strategic model for supply chain design with logical constraints: formulation and solution.

Computers & OR, 2003

Single machine scheduling with a variable common due date and resource-dependent processing times.

Computers & OR, 2003

Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine.

Computers & OR, 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

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.

IJITM, 2002

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

Computers & OR, 2002

Common due date assignment and scheduling with ready times.

Computers & OR, 2002

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.

Industrial Management and Data Systems, 2001

Single machine batch scheduling with resource dependent setup and processing times.

European Journal of Operational Research, 2001

Single machine scheduling with step-deteriorating processing times.

European Journal of Operational Research, 2001

Single-machine scheduling with a common due window.

Computers & OR, 2001

Batch scheduling in the no-wait two-machine flowshop to minimize the makespan.

Computers & OR, 2001

Minimizing Weighted Number of Early and Tardy Jobs with a Common Due Window Involving Location Penalty.

Annals OR, 2001

Single Supplier Scheduling for Multiple Deliveries.

Annals OR, 2001

2000

An improved heuristic for two-machine flowshop scheduling with an availability constraint.

Oper. Res. Lett., 2000

Single Machine Scheduling with Learning Effect Considerations.

Annals OR, 2000

A permutation flow-shop scheduling problem with convex models of operation processing times.

Annals OR, 2000

Single Machine Scheduling with Deadlines and Increasing Rates of Processing Times.

Acta Inf., 2000

1999

MSS4TQM-a management support system for total quality management.

IEEE Trans. Systems, Man, and Cybernetics, Part C, 1999

A note on scheduling the two-machine flexible flowshop.

IEEE Trans. Robotics and Automation, 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.

European Journal of Operational Research, 1999

Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness.

European Journal of Operational Research, 1999

One-operator-two-machine flowshop scheduling with setup and dismounting times.

Computers & OR, 1999

The time dependent machine makespan problem is strongly NP-complete.

Computers & OR, 1999

Multiple-machine scheduling with earliness, tardiness and completion time penalties.

Computers & OR, 1999

1998

Bicriterion Single Machine Scheduling with Resource Dependent Processing Times.

SIAM Journal on Optimization, 1998

The Complexity of Scheduling Starting Time Dependent Tasks with Release Times.

Inf. Process. Lett., 1998

Multi-machine Scheduling with Variance Minimization.

Discrete Applied Mathematics, 1998

1997

Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties.

SIAM Journal on Optimization, 1997

Two-stage flowshop scheduling with a common second-stage machine.

Computers & OR, 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.

Discrete Applied Mathematics, 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.

Computers & OR, 1995

1994

Parallel Machine Scheduling with Batch Setup Times.

Operations Research, 1994

One-machine batching and sequencing of multiple-type items.

Computers & OR, 1994

1993

Parallel Machine Scheduling to Minimize Costs for Earliness and Number of Tardy Jobs.

Discrete Applied Mathematics, 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.

Computers & OR, 1990

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

Computers & OR, 1990

1988

Optimal common due-date with limited completion time deviation.

Computers & OR, 1988

1987

An algorithm for the con due-date determination and sequencing problem.

Computers & OR, 1987

1986

EOQ with limited backorder delays.

Computers & OR, 1986