Bechtold, 1991 - Google Patents

Optimal Work‐Rest Schedules with a Set of Fixed‐Duration Rest Periods

Bechtold, 1991

Document ID
10233079243192267946
Author
Bechtold S
Publication year
Publication venue
Decision Sciences

External Links

Snippet

This paper demonstrates that the problem of optimizing the work output of an individual employee, subject to a set of fixed‐duration rest periods over a continuous time horizon, can be modeled with a quadratic programming formulation. Exogenous determination of break …
Continue reading at onlinelibrary.wiley.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G06Q10/063—Operations research or analysis
    • G06Q10/0631—Resource planning, allocation or scheduling for a business operation
    • G06Q10/06315—Needs-based resource requirements planning or analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled

Similar Documents

Publication Publication Date Title
Moon et al. TECHNICAL NOTEA note on lead time and distributional assumptions in continuous review inventory models
Moses et al. Real-time due-date promising by build-to-order environments
Gümüş et al. Global optimization of nonlinear bilevel programming problems
Elmaghraby et al. On the measurement of complexity in activity networks
Oukil et al. Ranking dispatching rules in multi-objective dynamic flow shop scheduling: a multi-faceted perspective
Teichroew A survey of languages for stating requirements for computer-based information systems
Smith et al. Due date selection procedures for job-shop simulation
Amburgey Multivariate point process models in social research
Vanden Bosch et al. Scheduling and sequencing arrivals to an appointment system
US20060101052A1 (en) Method and system for sequencing and scheduling
Melchiors Restricted time-remembering policies for the inventory rationing problem
Inoue et al. An empirical evaluation of several methods to select the best system
Bechtold Optimal Work‐Rest Schedules with a Set of Fixed‐Duration Rest Periods
Liu et al. Coordination of multiple agents for production management
Shih et al. Fuzzy inference-based multiple criteria FMS scheduling
Wang Fuzzy multicriteria decision making—an overview
Quiggin et al. A state-contingent production approach to principal-agent problems with an application to point-source pollution control
Rappold et al. A computationally efficient approach for determining inventory levels in a capacitated multiechelon production‐distribution system
Soroush Risk taking in stochastic PERT networks
Başağaoğlu et al. Optimal capacity-expansion planning in multiaquifer systems
Deckro et al. Modeling diminishing returns in project resource planning
Durán-Peña A MIXED-INTEGER NONLINEAR PROGAMMING APPROACH FOR THE SYSTEMATIC SYNTHESIS OF ENGINEERING SYSTEMS (PROCESS SYNTHESIS, NONDIFFERENTIABLE OPTIMIZATION, HEAT INTEGRATION, OPERATIONS RESEARCH, COMPUTER-AIDED DESIGN)
Chen A study on the timeliness property in real-time systems
Aronson et al. A Clustering Algorithm for Computer‐Assisted Process Organization
Breitinger et al. Improving search for job-shop scheduling with CLP (FD)