Early warning of atrial fibrillation using deep learning.

Optimal Intraproject Learning.

Design of Patient Visit Itineraries in Tandem Systems.

Treatment Planning for Victims with Heterogeneous Time Sensitivities in Mass Casualty Incidents.

Erratum to "Competitive Two-Agent Scheduling and Its Applications".

Batching and scheduling in a continuous-discrete hybrid flowshop: Lagrangian relaxation-based heuristic algorithms.

Surgery scheduling in the presence of operating room eligibility and dedicated surgeon: an adaptive composite dispatching method.

Multi-period lot-sizing with supplier selection: Structural results, complexity and algorithms.

Multi-level, multi-stage lot-sizing and scheduling in the flexible flow shop with demand information updating.

Home service routing and appointment scheduling with stochastic service times.

Managing Appointment-Based Services in the Presence of Walk-in Customers.

Online scheduling for outpatient services with heterogeneous patients and physicians.

Integrated pricing and production scheduling of multiple customized products with a common base product.

Vehicle routing and appointment scheduling with team assignment for home services.

Online Order Scheduling Problem with the Same Order Size on Two Identical Machines.

Single machine SLK/DIF due window assignment problem with job-dependent linear deterioration effects.

Semi-online scheduling with combined information on two identical machines in parallel.

Resource-constrained machine scheduling with machine eligibility restriction and its applications to surgical operations scheduling.

A Note on Appointment Scheduling with Piecewise Linear Cost Functions.

Several semi-online scheduling problems on two identical machines with combined information.

A Cluster-Based Context-Tree Model for Multivariate Data Streams with Applications to Anomaly Detection.

The Effect of financing on a Budget-Constrained Supply Chain under Wholesale Price Contract.

Competitive Two-Agent Scheduling and Its Applications.

Scheduling two agents with controllable processing times.

Including subjective norm and technology trust in the technology acceptance model: a case of e-ticketing in China.

Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs.

Scheduling imprecise computation tasks on uniform processors.

Improved algorithm for maximizing service of carousel storage.

Parallel machine selection and job scheduling to minimize machine cost and job tardiness.

Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties.

Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.