Jatinder N. D. Gupta

Comput. Ind. Eng., 2019

Supply Chain Coordination with a Risk-Averse Retailer and a Combined Buy-Back and Revenue Sharing Contract.

[BibT_eX]

[DOI]

Asia Pac. J. Oper. Res., 2019

Optimal Decisions of a Supply Chain With a Risk-Averse Retailer and Portfolio Contracts.

[BibT_eX]

[DOI]

IEEE Access, 2019

A Sequential Investigation Model for Solving Time Critical Digital Forensic Cases Involving a Single Investigator.

[BibT_eX]

[DOI]

Seong-Moo Yoo

Proceedings of the National Cyber Summit, 2019

2018

Family scheduling with batch availability in flow shops to minimize makespan.

[BibT_eX]

[DOI]

Liji Shen

J. Sched., 2018

Robust single machine scheduling with uncertain release times for minimising the maximum waiting time.

[BibT_eX]

[DOI]

Int. J. Prod. Res., 2018

An improved cuckoo search algorithm for scheduling jobs on identical parallel machines.

[BibT_eX]

[DOI]

Dipak Laha

Comput. Ind. Eng., 2018

2017

Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence.

[BibT_eX]

[DOI]

Bertrand M. T. Lin

F. J. Hwang

J. Sched., 2017

The Security Development Lifecycle in the Context of Accreditation Policies and Standards.

[BibT_eX]

[DOI]

IEEE Secur. Priv., 2017

2016

Heuristics for Provisioning Services to Workflows in XaaS Clouds.

[BibT_eX]

[DOI]

Zhicheng Cai

Xiaoping Li

IEEE Trans. Serv. Comput., 2016

A comprehensive review of flowshop group scheduling literature.

[BibT_eX]

[DOI]

Janis Sebastian Neufeld

Udo Buscher

Comput. Oper. Res., 2016

A heuristic for maximizing investigation effectiveness of digital forensic cases involving multiple investigators.

[BibT_eX]

[DOI]

Seong-Moo Yoo

Comput. Oper. Res., 2016

A Hungarian penalty-based construction algorithm to minimize makespan and total flow time in no-wait flow shops.

[BibT_eX]

[DOI]

Dipak Laha

Comput. Ind. Eng., 2016

2015

Solving the multi-objective flowline manufacturing cell scheduling problem by hybrid harmony search.

[BibT_eX]

[DOI]

Yazhi Li

Xiaoping Li

Expert Syst. Appl., 2015

Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness.

[BibT_eX]

[DOI]

Arne Mensendiek

Jan Herrmann

Eur. J. Oper. Res., 2015

A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2015

An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem.

[BibT_eX]

[DOI]

Appl. Soft Comput., 2015

2014

Semi-Supervised and Unsupervised Extreme Learning Machines.

[BibT_eX]

[DOI]

IEEE Trans. Cybern., 2014

Flow shop batching and scheduling with sequence-dependent setup times.

[BibT_eX]

[DOI]

Liji Shen

Udo Buscher

J. Sched., 2014

A penalty-shift-insertion-based algorithm to minimize total flow time in no-wait flow shops.

[BibT_eX]

[DOI]

Dipak Laha

Sagar U. Sapkal

J. Oper. Res. Soc., 2014

The ordinal consistency of an incomplete reciprocal preference relation.

[BibT_eX]

[DOI]

Yejun Xu

Huimin Wang

Fuzzy Sets Syst., 2014

Scheduling Identical Parallel Machines with a Fixed Number of Delivery Dates.

[BibT_eX]

[DOI]

Arne Mensendiek

Proceedings of the Operations Research Proceedings 2014, 2014

2013

A second order cone programming approach for semi-supervised learning.

[BibT_eX]

[DOI]

Pattern Recognit., 2013

Maximizing Investigation Effectiveness in Digital Forensic Cases.

[BibT_eX]

[DOI]

Seong-Moo Yoo

Proceedings of the International Conference on Social Computing, SocialCom 2013, 2013

Critical Path-Based Iterative Heuristic for Workflow Scheduling in Utility and Cloud Computing.

[BibT_eX]

[DOI]

Zhicheng Cai

Xiaoping Li

Proceedings of the Service-Oriented Computing - 11th International Conference, 2013

Bi-direction Adjust Heuristic for Workflow Scheduling in Clouds.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE International Conference on Parallel and Distributed Systems, 2013

2012

A three-phase algorithm for flowshop scheduling with blocking to minimize makespan.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2012

2010

Single machine scheduling with sequence-dependent family setups to minimize maximum lateness.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2010

2009

Lower confidence limits for process capability indices C<sub>p</sub> and C<sub>pk</sub> when data are autocorrelated.

[BibT_eX]

[DOI]

Qual. Reliab. Eng. Int., 2009

An integrative evaluation framework for intelligent decision support systems.

[BibT_eX]

[DOI]

Gloria E. Phillips-Wren

Eur. J. Oper. Res., 2009

2008

Makespan distribution of permutation flowshop schedules.

[BibT_eX]

[DOI]

J. Sched., 2008

Single machine scheduling with time deteriorating job values.

[BibT_eX]

[DOI]

S. Raut

S. Swami

J. Oper. Res. Soc., 2008

Single machine scheduling with family setups to minimize total earliness and tardiness.

[BibT_eX]

[DOI]

Jeffrey E. Schaller

Eur. J. Oper. Res., 2008

Supply chain scheduling: Just-in-time environment.

[BibT_eX]

[DOI]

U. V. Manoj

Sushil K. Gupta

Chelliah Sriskandarajah

Ann. Oper. Res., 2008

2007

An initial research agenda for SCM information systems.

[BibT_eX]

[DOI]

Alberto Caldelas-Lopez

Joan A. Pastor

Int. J. Netw. Virtual Organisations, 2007

2006

A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times.

[BibT_eX]

[DOI]

Fan T. Tseng

Edward F. Stafford Jr.

J. Oper. Res. Soc., 2006

Minimizing flow time in a flow-line manufacturing cell with family setup times.

[BibT_eX]

[DOI]

Jeffrey E. Schaller

J. Oper. Res. Soc., 2006

Flowshop scheduling research after five decades.

[BibT_eX]

[DOI]

Edward F. Stafford

Eur. J. Oper. Res., 2006

Performance guarantees for flowshop heuristics to minimize makespan.

[BibT_eX]

[DOI]

Christos Koulamas

George J. Kyparisis

Eur. J. Oper. Res., 2006

A review of TSP based approaches for flowshop scheduling.

[BibT_eX]

[DOI]

Tapan P. Bagchi

Chelliah Sriskandarajah

Eur. J. Oper. Res., 2006

A framework for designing the enterprise-wide e-commerce portal for evolving organizations.

[BibT_eX]

[DOI]

Nilmini Wickramasinghe

Electron. Commer. Res., 2006

Effect of technological breakthroughs on electronic markets.

[BibT_eX]

[DOI]

Xiaotong Li

James V. Koch

Electron. Commer. Res., 2006

2005

Comparative evaluation of MILP flowshop models.

[BibT_eX]

[DOI]

Edward F. Stafford Jr.

Fan T. Tseng

J. Oper. Res. Soc., 2005

A review and classification of heuristics for permutation flow-stop scheduling with makespan objective.

[BibT_eX]

[DOI]

Jose M. Framiñan

Rainer Leisten

J. Oper. Res. Soc., 2005

An exploratory study of groupware use in the knowledge management process.

[BibT_eX]

[DOI]

Ganesh D. Bhatt

Fred L. Kitchens

J. Enterp. Inf. Manag., 2005

Intelligent Decision-Making Support Systems. A Strategic Research Agenda.

[BibT_eX]

[DOI]

Francisco Cervantes-Pérez

J. Decis. Syst., 2005

Toward a Comprehensive Framework for the Design and Evaluation of Intelligent Decision-making Support Systems (i-DMSS).

[BibT_eX]

[DOI]

Francisco Cervantes-Pérez

Leonardo Garrido

J. Decis. Syst., 2005

Interactive patterns of knowledge management in organisations: insight from a fashion company.

[BibT_eX]

[DOI]

Ganesh D. Bhatt

Int. J. Inf. Technol. Manag., 2005

Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs.

[BibT_eX]

[DOI]

Alex J. Ruiz-Torres

Eur. J. Oper. Res., 2005

Scheduling tasks on a flexible manufacturing machine to minimize tool change delays.

[BibT_eX]

[DOI]

Klaus H. Ecker

Eur. J. Oper. Res., 2005

Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups.

[BibT_eX]

[DOI]

Paulo Morelato França

Comput. Ind. Eng., 2005

SMEs in Knowledge-Based Economies.

[BibT_eX]

[DOI]

Nilmini Wickramasinghe

Proceedings of the Encyclopedia of Information Science and Technology (5 Volumes), 2005

Small Busines Transformation Through Knowledge Management.

[BibT_eX]

[DOI]

Nory B. Jones

Proceedings of the Encyclopedia of Information Science and Technology (5 Volumes), 2005

Decision-Making Support Systems.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Information Science and Technology (5 Volumes), 2005

2004

Strategic Information Systems in the Post-Net Era.

[BibT_eX]

[DOI]

Mohammed Quaddus

Robert D. Galliers

J. Strateg. Inf. Syst., 2004

A review and classification of heuristics for permutation flow-shop scheduling with makespan objective.

[BibT_eX]

[DOI]

Jose M. Framiñan

Rainer Leisten

J. Oper. Res. Soc., 2004

A savings index heuristic algorithm for flowshop scheduling with sequence-dependent setup times.

[BibT_eX]

[DOI]

S. R. Das

Basheer M. Khumawala

J. Oper. Res. Soc., 2004

Two-Machine Flow Shop Scheduling with Nonregular Criteria.

[BibT_eX]

[DOI]

Volker Lauff

Frank Werner

J. Math. Model. Algorithms, 2004

Improving Workers' Productivity and Reducing Internet Abuse.

[BibT_eX]

[DOI]

J. Comput. Inf. Syst., 2004

Operational and financial effectiveness of e-collaboration tools in supply chain integration.

[BibT_eX]

[DOI]

Adolfo Crespo Marquez

Carmine Bianchi

Eur. J. Oper. Res., 2004

Web services architecture for m-government: issues and challenges.

[BibT_eX]

[DOI]

Electron. Gov. an Int. J., 2004

Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2004

2003

Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time.

[BibT_eX]

[DOI]

Alex J. Ruiz-Torres

Scott Webster

J. Oper. Res. Soc., 2003

Building Blocks of an E-Government: A Framework.

[BibT_eX]

[DOI]

J. Electron. Commer. Organ., 2003

Two-machine flowshop scheduling with a secondary criterion.

[BibT_eX]

[DOI]

Vincent T'kindt

Jean-Charles Billaut

Comput. Oper. Res., 2003

A Framework to Assess Intelligent Decision-Making Support Systems.

[BibT_eX]

[DOI]

Manuel Mora T.

Francisco Cervantes-Pérez

Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2003

2002

Globalization and Information Management Strategy.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Information Systems, 2002

Insights into two solution procedures for the single machine tardiness problem.

[BibT_eX]

[DOI]

Jaideep T. Naidu

Bahram Alidaee

J. Oper. Res. Soc., 2002

Effectiveness of Systems Analysis and Design Education: An Exploratory Study.

[BibT_eX]

[DOI]

Rajiv Kohli

J. Organ. End User Comput., 2002

Editorial.

[BibT_eX]

[DOI]

J. Decis. Syst., 2002

Heuristics for hybrid flow shops with controllable processing times and assignable due dates.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2002

Local search heuristics for two-stage flow shop problems with secondary criterion.

[BibT_eX]

[DOI]

Karsten Hennig

Frank Werner

Comput. Oper. Res., 2002

2001

Minimizing makespan subject to minimum flowtime on two identical parallel machines.

[BibT_eX]

[DOI]

Johnny C. Ho

Comput. Oper. Res., 2001

A multi-neural-network learning for lot sizing and sequencing on a flow-shop.

[BibT_eX]

[DOI]

In Lee

Amar D. Amar

Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001

Continuous Function Optimisation via Gradient Descent on a Neural Network Approximation Function.

[BibT_eX]

[DOI]

Kate A. Smith

Proceedings of the Connectionist Models of Neurons, 2001

2000

Bicriteria optimisation of the makespan and mean flowtime on two identical parallel machines.

[BibT_eX]

[DOI]

Johnny C. Ho

Scott Webster

J. Oper. Res. Soc., 2000

Comparative evaluation of genetic algorithm and backpropagation for training neural networks.

[BibT_eX]

[DOI]

Randall S. Sexton

Inf. Sci., 2000

Selecting Scheduling Heuristics Using Neural Networks.

[BibT_eX]

[DOI]

Randall S. Sexton

Enar A. Tunc

INFORMS J. Comput., 2000

IT takes a village: Virtual communities in support of education.

[BibT_eX]

[DOI]

Renee M. Wachter

Mohammed A. Quaddus

Int. J. Inf. Manag., 2000

Scheduling a flowline manufacturing cell with sequence dependent family setup times.

[BibT_eX]

[DOI]

Jeffrey E. Schaller

Asoo J. Vakharia

Eur. J. Oper. Res., 2000

Minimizing makespan subject to minimum total flow-time on identical parallel machines.

[BibT_eX]

[DOI]

Alex J. Ruiz-Torres

Eur. J. Oper. Res., 2000

Minimizing tardy jobs in a flowshop with common due date.

[BibT_eX]

[DOI]

Federico Della Croce

Roberto Tadei

Eur. J. Oper. Res., 2000

Neural networks in business: techniques and applications for the operations researcher.

[BibT_eX]

[DOI]

Kate A. Smith

Comput. Oper. Res., 2000

1999

Two-Machine No-Wait Flow Shop Scheduling with Missing Operations.

[BibT_eX]

[DOI]

Celia A. Glass

Chris N. Potts

Math. Oper. Res., 1999

Single‐machine scheduling to minimize maximumtardiness with minimum number of tardy jobs.

[BibT_eX]

[DOI]

A. M. A. Hariri

Chris N. Potts

Ann. Oper. Res., 1999

1998

Minimising makespan in the two-machine flow-shop with release times.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 1998

1997

Batch scheduling to minimize maximum lateness.

[BibT_eX]

[DOI]

Jay B. Ghosh

Oper. Res. Lett., 1997

Two-stage no-wait scheduling models with setup and removal times separated.

[BibT_eX]

[DOI]

Vitaly A. Strusevich

Carin M. Zwaneveld

Comput. Oper. Res., 1997

Distance education and the use of computers as instructional tools for systems development projects: A case study of the construction of expert systems.

[BibT_eX]

[DOI]

Renee M. Wachter

Comput. Educ., 1997

Single machine hierarchical scheduling with customer orders and multiple job classes.

[BibT_eX]

[DOI]