Soft Scheduling

@article{Rudov2001SoftS,
  title={Soft Scheduling},
  author={Hana Rudov{\'a}},
  journal={ArXiv},
  year={2001},
  volume={cs.AI/0106004}
}
Classical notions of disjunctive and cumulative scheduling are studied from the point of view of soft constraint satisfaction. Soft disjunctive scheduling is introduced as an instance of soft CSP and preferences included in this problem are applied to generate a lower bound based on existing discrete capacity resource. Timetabling problems at Purdue University and Faculty of Informatics at Masaryk University considering individual course requirements of students demonstrate practical problems… 
University Course Timetabling with Soft Constraints
An extension of constraint logic programming that allows for weighted partial satisfaction of soft constraints is described and applied to the development of an automated timetabling system for
Integrated Modelling for Planning, Scheduling, and Timetabling Problems
TLDR
This paper proposes a generic model covering scheduling and timetabling problems as well as some problems for planning under time and resource constraints and aims to cover various aspects of these problems in the common model.
iRDM: A solution for workforce supply chain management in an outsourcing environment
  • Jin Dong, C. Ren, Hongwei Ding
  • Business
    2008 IEEE International Conference on Service Operations and Logistics, and Informatics
  • 2008
Workforce is crucial to the success of service industry, especially for those software and consulting firms, where much of their revenue comes from the assignment of highly-skilled professionals.
Low-Power Design with NISC Technology
TLDR
This chapter introduces a new generation of processors, called No-Instruction-Set- Computer (NISC), that gives the full control of the datapath to the compiler, in order to simplify the controller hardware, and enable fast architecture customizations.

References

SHOWING 1-10 OF 13 REFERENCES
Partial Constraint Satisfaction
Constraint Satisfaction with Preferences
TLDR
This thesis is focused on CSPs on finite domains because of their practical applicability and proposes both proposals as approaches allowing to express properties of the problem declaratively by means of constraints and to search for its solution via specialized algorithms.
Constraint-based Timetabling with Student Schedules
TLDR
The Faculty of Informatics timetabling problem represents very complex scheduling and resource allocation problem as individual timetable for every student has to be scheduled with respect to heterogeneous choices of the students for their courses.
Constraint-Based Timetabling for Universities
TLDR
Constraint logic programming is used and methods, techniques and concepts for a combined interactive and automatic timetabling of university courses and school curricula are developed.
Time and resource constrained scheduling : a constraint satisfaction approach
TLDR
The final author version and the galley proof are versions of the publication after peer review that features the final layout of the paper including the volume, issue and page numbers.
Complete University Modular Timetabling Using Constraint Logic Programming
TLDR
This paper describes the experience in constructing a large scale modular timetable using Constraint Logic Programming techniques.
An Open-Ended Finite Domain Constraint Solver
We describe the design and implementation of a finite domain constraint solver embedded in a Prolog system using an extended unification mechanism via attributed variables as a generic constraint
Propagation and satisfaction of flexible constraints. In Fuzzy Sets, Neural Networks and Soft Computing, pages 166–187
  • 1994
Semiring-based constraint solving and optimization
Building University Timetables Using Constraint Logic Programming
...
...