Pages that link to "Item:Q1600949"
From MaRDI portal
The following pages link to A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949):
Displaying 50 items.
- Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs (Q263077) (← links)
- Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs (Q298499) (← links)
- Influence of order acceptance policies on optimal capacity investment with stochastic customer required lead times (Q319148) (← links)
- Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance (Q323343) (← links)
- A note: minmax due-date assignment problem with lead-time cost (Q336460) (← links)
- Setting optimal due dates in a basic safe-scheduling model (Q336772) (← links)
- Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics (Q337323) (← links)
- A survey on offline scheduling with rejection (Q398830) (← links)
- A bicriteria approach to scheduling a single machine with job rejection and positional penalties (Q437059) (← links)
- Time and work generalised precedence relationships in project scheduling with pre-emption: an application to the management of service centres (Q439612) (← links)
- Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration (Q478929) (← links)
- Four single-machine scheduling problems involving due date determination decisions (Q497630) (← links)
- Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times (Q505770) (← links)
- Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning (Q541440) (← links)
- Scheduling problems with partially ordered jobs (Q612206) (← links)
- Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration (Q613268) (← links)
- Single machine multiple common due dates scheduling with learning effects (Q630690) (← links)
- Single-machine due-window assignment problem with learning effect and deteriorating jobs (Q639174) (← links)
- On scheduling around large restrictive common due windows (Q704121) (← links)
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments (Q708343) (← links)
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries (Q763109) (← links)
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment (Q829197) (← links)
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) (← links)
- Optimal due date assignment in multi-machine scheduling environments (Q835592) (← links)
- A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date (Q856323) (← links)
- Two due date assignment problems in scheduling a single machine (Q867932) (← links)
- A mixed integer programming model for advanced planning and scheduling (APS) (Q872302) (← links)
- Order acceptance with weighted tardiness (Q878579) (← links)
- Due-window assignment problems with unit-time jobs (Q902534) (← links)
- Single-machine scheduling against due dates with past-sequence-dependent setup times (Q933538) (← links)
- Group sequencing around a common due date (Q937402) (← links)
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times (Q940868) (← links)
- A differential evolution approach for the common due date early/tardy job scheduling problem (Q941556) (← links)
- Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date (Q947941) (← links)
- A note: Common due date assignment for a single machine scheduling with the rate-modifying activity (Q954028) (← links)
- Skilled workforce scheduling in service centres (Q954927) (← links)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- A due-date assignment problem with learning effect and deteriorating jobs (Q967804) (← links)
- A unified approach for scheduling with convex resource consumption functions using positional penalties (Q976312) (← links)
- Due dates assignment and JIT scheduling with equal-size jobs (Q976442) (← links)
- Optimal due date assignment and resource allocation in a group technology scheduling environment (Q991385) (← links)
- Minmax scheduling problems with a common due-window (Q1000973) (← links)
- A multi-criteria scheduling with due-window assignment problem (Q1007672) (← links)
- Revenue management and demand fulfillment: Matching applications, models, and software (Q1017960) (← links)
- Scheduling identical jobs and due-window on uniform machines (Q1038326) (← links)
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations (Q1038328) (← links)
- A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines (Q1040984) (← links)
- Order acceptance and due-date quotation in low machine rates (Q1630128) (← links)
- Single machine common flow allowance scheduling with deteriorating jobs and a rate-modifying activity (Q1634141) (← links)
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection (Q1652303) (← links)
